The Largest Component in Subcritical Inhomogeneous Random Graphs

DOI10.1017/S0963548310000180zbMath1225.05221arXiv0706.2106MaRDI QIDQ3068818

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)

Related Items (5)

Subcritical Random Hypergraphs, High-Order Components, and Hypertrees ⋮ Nearly subadditive sequences ⋮ Phase transition in random distance graphs on the torus ⋮ Critical behavior in inhomogeneous random graphs ⋮ Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.

Cites Work

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

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