A new approach to the giant component problem

DOI10.1002/rsa.20231zbMath1177.05110arXiv0707.1786MaRDI QIDQ3619612

Svante Janson, Malwina J. Luczak

Publication date: 8 April 2009

Published in: Random Structures and Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random graph; empirical distribution; giant component; death process

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C07: Vertex degrees

Related Items

The front of the epidemic spread and first passage percolation, Law of large numbers for the SIR epidemic on a random graph with given degrees, Diffusion and cascading behavior in random networks, The component sizes of a critical random graph with given degree sequence, A weighted configuration model and inhomogeneous epidemics, The largest component in a subcritical random graph with a power law degree distribution, First passage percolation on random graphs with finite mean degrees, The diameter of weighted random graphs, An old approach to the giant component problem, The structure of typical clusters in large sparse random configurations, Ising critical exponents on random trees and graphs, Critical behavior in inhomogeneous random graphs, A general critical condition for the emergence of a giant component in random graphs with given degrees, Critical window for the vacant set left by random walk on random regular graphs, The scaling window for a random graph with a given degree sequence, Giant Component in Random Multipartite Graphs with Given Degree Sequences

Cites Work

• Unnamed Item
• Generating simple random graphs with prescribed degree distribution
• Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
• Asymptotic normality of the \(k\)-core in random graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Logarithmic combinatorial structures: A probabilistic approach
• Random subgraphs of the 2D Hamming graph: The supercritical phase
• On the Fluctuations of the Giant Component
• Critical percolation on random regular graphs
• Random graphs with forbidden vertex degrees
• A simple solution to the k‐core problem
• Local Limit Theorems for the Giant Component of Random Hypergraphs
• On tree census and the giant component in sparse random graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Probability: A Graduate Course
• A critical point for random graphs with a given degree sequence
• The birth of the giant component
• The phase transition in inhomogeneous random graphs
• Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
• The Critical Phase for Random Graphs with a Given Degree Sequence