Achlioptas process phase transitions are continuous

From MaRDI portal
Publication:453240


DOI10.1214/11-AAP798zbMath1255.05176arXiv1102.5306MaRDI QIDQ453240

Oliver Riordan, Lutz Warnke

Publication date: 19 September 2012

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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


05C80: Random graphs (graph-theoretic aspects)

60C05: Combinatorial probability


Related Items

Explosive Percolation in Erdős–Rényi-Like Random Graph Processes, On the Power of Choice for Boolean Functions, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), 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, Preferential attachment with choice, Discontinuous percolation transitions in cluster merging processes, The power of two choices for random walks, Given enough choice, simple local rules percolate discontinuously, The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs, Recent advances in percolation theory and its applications, Explosive transitions in complex networks' structure and dynamics: percolation and synchronization, A geometric Achlioptas process, Sesqui-type branching processes, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Critical random graphs and the differential equations technique, Preferential attachment without vertex growth: emergence of the giant component, Minimal contagious sets in random regular graphs, Choices and intervals, A gentle introduction to the differential equation method and dynamic concentration, The Bohman-Frieze process near criticality, Sharp thresholds for half-random games I, A Power-of-Two-Choices Unbalanced Allocation Process, Random k -SAT and the power of two choices, The evolution of subcritical Achlioptas processes, Choice-driven phase transition in complex networks, Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process



Cites Work