Series of Lectures and Exercises: Scalling Limits of Random Trees and Random Graphs; Prof. Nicolas Broutin
Sprache des Titels:
Since the pioneering work of Aldous in the 90s about the asymptotic shape of large random trees, the connection between combinatorial structures and stochastic processes such as Brownian motion have been proven very fruitful. I will present some essential aspects of the theory for random trees, and random graphs that allow to prove convergence of these as measured metric spaces. I will also try to point in the directions of recent developments and applications.