Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
In this 28-minute conference talk from the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2025), Alexander Gnedin from Queen Mary University presents a mathematical exploration of random graph growth models. Discover the probabilistic foundations, combinatorial structures, and asymptotic behaviors that characterize these models. The presentation, delivered on May 9, 2025 at the Fields Institute, offers insights into how random graphs evolve and the mathematical tools used to analyze their properties.
