Algorithms and Models for the Web-Graph

DOI10.1007/B101552MaRDI QIDQ5311163zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Oliver Riordan

Publication date 22 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b101552

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Network design and communication in computer systems (68M10)

Recommendations

• Continuity of the percolation threshold in randomly grown graphs.
• The phase transition in the uniformly grown random graph has infinite order
• The Small Giant Component in Scale-Free Random Graphs
• On a random graph evolving by degrees
• Giant components in random graphs

Cited in

(8)

• scientific article; zbMATH DE number 2046059 (Why is no real title available?)
• Merging percolation onZdand classical random graphs: Phase transition
• Continuity of the percolation threshold in randomly grown graphs.
• The phase transition in random graphs: a simple proof
• A power law for connectedness of some random graphs at the critical point
• Phase transitions in dynamical random graphs
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• The phase transition in the uniformly grown random graph has infinite order

This page was built for publication: Algorithms and Models for the Web-Graph

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