Critical random graphs: limiting constructions and distributional properties
From MaRDI portal
Abstract: We consider the Erdos-Renyi random graph G(n,p) inside the critical window, that is when p=1/n+ lambda*n^{-4/3}, for some fixed lambda in R. Then, as a metric space with the graph distance rescaled by n^{-1/3}, the sequence of connected components G(n,p) converges towards a sequence of continuous compact metric spaces. The result relies on a bijection between graphs and certain marked random walks, and the theory of continuum random trees. Our result gives access to the answers to a great many questions about distances in critical random graphs. In particular, we deduce that the diameter of G(n,p) rescaled by n^{-1/3} converges in distribution to an absolutely continuous random variable with finite mean.
Recommendations
- The continuum limit of critical random graphs
- A local limit theorem for the critical random graph
- Continuum limit of critical inhomogeneous random graphs
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- Scaling limit for the random walk on the largest connected component of the critical random graph
Cited in
(31)- The continuum limit of critical random graphs
- Scaling limit of random forests with prescribed degree sequences
- Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs
- Critical random graphs and the differential equations technique
- The probability of unusually large components in the near-critical Erdős-Rényi graph
- Asymptotics of trees with a prescribed degree sequence and applications
- Anatomy of the giant component: the strictly supercritical regime
- The scaling limit of a critical random directed graph
- Multisource invasion percolation on the complete graph
- Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs
- Geometry of the minimal spanning tree of a random 3-regular graph
- Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023
- scientific article; zbMATH DE number 4091541 (Why is no real title available?)
- Random gluing of metric spaces
- Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
- Random trees have height \(O(\sqrt{n})\)
- On breadth‐first constructions of scaling limits of random graphs and random unicellular maps
- The scaling limit of random cubic planar graphs
- Scaling limits of random trees and random graphs
- The critical window in random digraphs
- The mesoscopic geometry of sparse random maps
- Epidemics on critical random graphs with heavy-tailed degree distribution
- Cycle structure of percolation on high-dimensional tori
- Stable graphs: distributions and line-breaking construction
- Critical random forests
- Speeding up non-Markovian first-passage percolation with a few extra edges
- Maximum agreement subtrees and Hölder homeomorphisms between Brownian trees
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
- Continuum limit of critical inhomogeneous random graphs
This page was built for publication: Critical random graphs: limiting constructions and distributional properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638299)
