Scaling limits of random graphs

Louigi Addario-Berry, Christina Goldschmidt

Published 2024-10-17Version 1

This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric structure of these random objects in the limit as their size goes to infinity, with distances appropriately rescaled. We start with the simplest setting of random trees, before turning to various examples of random graphs, including the critical Erd\H{o}s--R\'enyi random graph.