Scaling limits of random graphs from subcritical classes (Q341486)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scaling limits of random graphs from subcritical classes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scaling limits of random graphs from subcritical classes |
scientific article |
Statements
Scaling limits of random graphs from subcritical classes (English)
0 references
16 November 2016
0 references
This paper considers the uniform random graph \(\mathcal{C}_n\) with \(n\) vertices drawn from a subcritical class of connected graphs. The main result is that the rescaled graph \(\mathcal{C}_n / \sqrt{n}\) converges to the Brownian continuum random tree \(\mathcal{T}_e\) multiplied by a constant scaling factor. In addition, sub-Gaussian tail bounds for the diameter \(D(\mathcal{C}_n)\) and height \(H(\mathcal{C}_n^{\bullet})\) of the rooted random graph \(\mathcal{C}_n^{\bullet}\) are given.
0 references
random graphs
0 references
continuum random tree
0 references
scaling limits
0 references
subcritical graph classes
0 references
first passage percolation
0 references
