The Largest Component in Subcritical Inhomogeneous Random Graphs

DOI10.1017/S0963548310000180MaRDI QIDQ3068818zbMATH OpenFDO

Authors Tatyana S. Turova

Publication date 17 January 2011

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0706.2106

zbMATH Keywords

inhomogeneous random graph modelrank 1 case

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Abstract: We study the "rank 1 case" of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result is new, it completes the corresponding known result in the supercritical case. We provide some examples of application of a new formula.

Recommendations

• The largest component in a subcritical random graph with a power law degree distribution
• Largest component of subcritical random graphs with given degree sequence
• On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase
• On the largest component of subcritical random hyperbolic graphs
• On the largest component of the random graph at a nearcritical stage
• Large-deviation properties of largest component for random graphs
• The largest component in critical random intersection graphs
• The Giant Component in a Random Subgraph of a Given Graph
• Asymptotics for the size of the largest component scaled to ``\(\log n\) in inhomogeneous random graphs

Cites work

• Generating simple random graphs with prescribed degree distribution
• Long paths and cycles in dynamical graphs
• Percolation
• The Multiplicative Process
• The phase transition in inhomogeneous random graphs
• The transitive closure of a random digraph
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees

Cited in

(12)

• On the largest component of subcritical random hyperbolic graphs
• Nearly subadditive sequences
• Critical behavior in inhomogeneous random graphs
• Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
• Asymptotics for the size of the largest component scaled to ``\(\log n\) in inhomogeneous random graphs
• Phase transition in random distance graphs on the torus
• Subcritical random hypergraphs, high-order components, and hypertrees
• Survey of scalings for the largest connected component in inhomogeneous random graphs
• Large-deviation properties of largest component for random graphs
• Upper bounds for the largest component in critical inhomogeneous random graphs
• Largest component of subcritical random graphs with given degree sequence
• The largest component in a subcritical random graph with a power law degree distribution

This page was built for publication: The Largest Component in Subcritical Inhomogeneous Random Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068818)