The Bohman-Frieze process near criticality

DOI10.1002/rsa.20437zbMath1272.05180arXiv1106.0484MaRDI QIDQ2852548

Mihyun Kang, Will Perkins, J. H. Spencer

Publication date: 9 October 2013

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

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

zbMATH Keywords

phase transition; random graphs; differential equation method; Achlioptas process

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

Related Items

Aggregation models with limited choice and the multiplicative coalescent, Convergence of Achlioptas Processes via Differential Equations with Unique Solutions, Bounded-Size Rules: The Barely Subcritical Regime, The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs, Sesqui-type branching processes, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Random k -SAT and the power of two choices, The evolution of subcritical Achlioptas processes, Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process

Cites Work

• Achlioptas process phase transitions are continuous
• Small subgraphs in random graphs and the power of multiple choices
• Homological connectivity of random 2-complexes
• The first cycles in an evolving graph
• Birth control for giants
• The early evolution of the \(H\)-free process
• Balanced online Ramsey games in random graphs
• The triangle-free process
• Random planar graphs
• Differential equations for random processes and random graphs
• Avoiding a giant component
• Two critical periods in the evolution of random planar graphs
• Hamiltonicity thresholds in Achlioptas processes
• Singularity Analysis of Generating Functions
• Avoiding small subgraphs in Achlioptas processes
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Percolation
• A critical point for random graphs with a given degree sequence
• Product rule wins a competitive game
• Creating a Giant Component
• The Critical Phase for Random Graphs with a Given Degree Sequence
• A phase transition for avoiding a giant component
• Embracing the giant component