The study of random graphs has emerged as a cornerstone of modern graph theory, offering insights into the fundamental properties of large networks across a wide range of applications. At the heart of this area lies the concept of universality, which explores how large-scale random graphs exhibit common structural features, regardless of the specific underlying probability distribution. Universality is not only fascinating from a mathematical perspective, but it is also powerful in applications, because it guarantees robustness of the conclusions to variations in the precise law of a network. During this afternoon-long meeting, four experts will illuminate different aspects of universality in random graphs. 
 
This is also an occasion to celebrate Serte Donderwinkel’s win at the RSS Applied Probability Section biennial PhD competition in 2024. 
 
Timetable: 
13:00 - 13:30 Doors open + coffee
13:30 - 14:15 Serte Donderwinkel
14:15 - 15:00 Louigi Addario-Berry
15:00 - 15:30 Coffee break
15:30 - 16:15 Minmin Wang
16:15 - 17:00 Christina Goldschmidt 
 

Contact Serte Donderwinkel, Terry Soo and Minmin Wang for Applied Probability Section Group 

Members - free to attend 

Non-members - £10