Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs

DOI10.1007/978-3-0346-0244-0_14zbMath1221.60007MaRDI QIDQ5198984

Tatyana S. Turova

Publication date: 10 August 2011

Published in: Random Walks, Boundaries and Spectra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-0346-0244-0_14

zbMATH Keywords

phase transitions; inhomogeneous random graphs

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

60C05: Combinatorial probability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics for the size of the largest component scaled to ``\(\log n\) in inhomogeneous random graphs
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• Novel scaling limits for critical inhomogeneous random graphs
• Generating simple random graphs with prescribed degree distribution
• The largest component in a subcritical random graph with a power law degree distribution
• Universality for the distance in finite variance random graphs
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The entrance boundary of the multiplicative coalescent
• On the largest component of the random graph at a nearcritical stage
• Long paths and cycles in dynamical graphs
• Critical behavior in inhomogeneous random graphs
• Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
• Asymptotic equivalence and contiguity of some random graphs
• Critical percolation on random regular graphs
• Merging percolation onZdand classical random graphs: Phase transition
• The transitive closure of a random digraph
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees
• The phase transition in inhomogeneous random graphs
• On a conditionally Poissonian graph process
• The Multiplicative Process