Logo Logo
Help
Contact
Switch language to German
Scaling limits of random trees and graphs
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.
continuum random tree, scaling limits, random trees, random graphs, invariance principles
Stufler, Benedikt
2015
English
Universitätsbibliothek der Ludwig-Maximilians-Universität München
Stufler, Benedikt (2015): Scaling limits of random trees and graphs. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics
[thumbnail of Stufler_Benedikt.pdf]
Preview
PDF
Stufler_Benedikt.pdf

1MB

Abstract

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.