Random graphs from structured classes
Colin McDiarmid

TL;DR
This paper studies the asymptotic properties of random graphs from structured classes, establishing smoothness and describing the limiting distribution of components for broad classes of graphs.
Contribution
It extends the concept of smoothness to a wider range of graph classes and provides detailed asymptotic analysis of their structural properties.
Findings
Graph classes are often smooth under general conditions.
Limiting distributions of graph fragments are characterized.
Results apply to classes with minimum degree constraints.
Abstract
Given a class of graphs, let denote the set of graphs in on vertex set . For certain classes , we are interested in the asymptotic behaviour of a random graph sampled uniformly from . Call smooth if tends to a limit as . Showing that a graph class is smooth is a key step in an approach to investigating properties of , in particular the asymptotic probability that is connected, and more generally the asymptotic behaviour of the fragment of outside the largest component. The composition method of Bender, Canfield and Richmond shows that the class of graphs embeddable in a given surface is smooth; and similarly we have smoothness for any minor-closed class of graphs with 2-connected excluded minors. Here we develop the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Stochastic processes and statistical mechanics · Advanced Graph Theory Research
