Slow emergence of the giant component in the growing m‐out graph

DOI10.1002/RSA.20060zbMath1074.05081OpenAlexW4249946793MaRDI QIDQ5311910

Béla Bollobás, Oliver Riordan

Publication date: 29 August 2005

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

Full work available at URL: https://doi.org/10.1002/rsa.20060

zbMATH Keywords

phase transitionrandom graphinfinite order

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (3)

Near critical preferential attachment networks have small giant components ⋮ The convergence of the exploration process for critical percolation on the \(k\)-out graph ⋮ Renormalization-group theory of the abnormal singularities at the critical-order transition in bond percolation on pointed hierarchical graphs

Cites Work

• Crawling on Simple Models of Web Graphs
• Unnamed Item

This page was built for publication: Slow emergence of the giant component in the growing m‐out graph