Merging percolation onZdand classical random graphs: Phase transition

DOI10.1002/RSA.20287zbMath1209.05231arXivmath/0612644OpenAlexW2082667028MaRDI QIDQ3055883

Tatyana S. Turova, Thomas Vallier

Publication date: 10 November 2010

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

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

zbMATH Keywords

percolationphase transitioninhomogeneous random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (3)

Asymptotics for the size of the largest component scaled to ``\(\log n\) in inhomogeneous random graphs ⋮ Bootstrap percolation on a graph with random and local connections ⋮ Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs

Cites Work

• Phase transitions in dynamical random graphs
• Concentration of measure and isoperimetric inequalities in product spaces
• Percolation
• Random graphs and grammars on graphs
• The phase transition in inhomogeneous random graphs
• Collective dynamics of ‘small-world’ networks
• On a Random Graph Related to Quantum Theory

This page was built for publication: Merging percolation onZdand classical random graphs: Phase transition