Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Explore advanced techniques for asymptotically enumerating regular graphs in this second part of a graduate-level mathematics lecture. Delve into three primary methodological approaches: the configuration model and switchings, generating functions combined with saddle point methods, and the relatively recent Stein's method approach utilizing degree switchings to derive recursive formulas. Focus particularly on the latter method while understanding how these enumeration techniques extend beyond mere counting to applications in generating graphs with specified degree sequences, network design and testing, network dynamics analysis, and real-world system modeling. Build upon foundational discrete probability theory concepts while working with concentration inequalities such as Chernoff and Azuma-Hoeffding bounds. Engage with cutting-edge research in extremal and probabilistic combinatorics, examining connections to analysis, geometry, number theory, statistical physics, and theoretical computer science within the broader context of contemporary discrete mathematics research.
