Scaling limits of random trees and graphs

In this thesis, we establish the scaling limit of several models of random trees and graphs, enlarging and completing the now long list of random structures that admit David Aldous' continuum random tree (CRT) as scaling limit. Our results answer important open questions, in particular the conjecture by Aldous for the scaling limit of random unlabelled unrooted trees. We also show that random graphs from subcritical graph classes admit the CRT as scaling limit, proving (in a strong from) a conjecture by Marc Noy and Michael Drmota, who conjectured a limit for the diameter of these graphs. Furthermore, we provide a new proof for results by Bénédicte Haas and Grégory Miermont regarding the scaling limits of random Pólya trees, extending their result to random Pólya trees with arbitrary vertex-degree restrictions.

You can listen to Scaling limits of random trees and graphs online on Radio and Podcast. Open the player on this page to stream the available audio.

Scaling limits of random trees and graphs is an episode from Fakultät für Mathematik, Informatik und Statistik - Digitale Hochschulschriften der LMU - Teil 02/02 by Ludwig-Maximilians-Universität München.

This episode is 0 long.

This episode was published on Oct 23, 2015.

Yes. Use the heart button on the episode page to add it to your favorite episodes list.

Yes. This page shows related episodes from Fakultät für Mathematik, Informatik und Statistik - Digitale Hochschulschriften der LMU - Teil 02/02 when more episodes are available from the podcast feed.