The phase transition in the uniformly grown random graph has infinite order

DOI10.1002/rsa.20041zbMath1063.05121MaRDI QIDQ4667854

Oliver Riordan, Béla Bollobás, Svante Janson

Publication date: 21 April 2005

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

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

zbMATH Keywords

giant component

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

Related Items

The Phase Transition in Multitype Binomial Random Graphs, Thek-Core and Branching Processes, Unnamed Item, Convergence properties of the degree distribution of some growing network models, Asymptotics for the size of the largest component scaled to ``\(\log n\) in inhomogeneous random graphs, Spanning forests in regular planar maps, Phase transitions in dynamical random graphs, Near critical preferential attachment networks have small giant components, Evolution of a modified binomial random graph by agglomeration, Random networks with sublinear preferential attachment: the giant component, Percolation on complex networks: theory and application, Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network

Cites Work

• Unnamed Item
• Unnamed Item
• Connectedness of certain random graphs
• When are random graphs connected
• The diameter of a scale-free random graph
• The scaling window of the 2-SAT transition
• Emergence of Scaling in Random Networks
• The transitive closure of a random digraph
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The Structure and Function of Complex Networks