Birth control for giants
From MaRDI portal
Publication:949755
DOI10.1007/s00493-007-2163-2zbMath1164.05062OpenAlexW1975999171MaRDI QIDQ949755
Nicholas C. Wormald, J. H. Spencer
Publication date: 21 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-2163-2
Related Items (44)
Sesqui-type branching processes ⋮ The power of two choices for random walks ⋮ Product rule wins a competitive game ⋮ Getting a Directed Hamilton Cycle Two Times Faster ⋮ Random k -SAT and the power of two choices ⋮ The evolution of subcritical Achlioptas processes ⋮ The mixing time of the giant component of a random graph ⋮ Explosive percolation in the human protein homology network ⋮ On the Power of Choice for Boolean Functions ⋮ A gentle introduction to the differential equation method and dynamic concentration ⋮ A probabilistic approach to the leader problem in random graphs ⋮ A geometric Achlioptas process ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ Given enough choice, simple local rules percolate discontinuously ⋮ Convergence of Achlioptas Processes via Differential Equations with Unique Solutions ⋮ Stochastic coalescence in logarithmic time ⋮ Achlioptas process phase transitions are continuous ⋮ The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs ⋮ Choice-driven phase transition in complex networks ⋮ Explosive Percolation in Erdős–Rényi-Like Random Graph Processes ⋮ Preferential attachment without vertex growth: emergence of the giant component ⋮ Critical random graphs and the differential equations technique ⋮ Continuum limit of critical inhomogeneous random graphs ⋮ Recent advances in percolation theory and its applications ⋮ Explosive transitions in complex networks' structure and dynamics: percolation and synchronization ⋮ Phase transitions for modified Erdős--Rényi processes ⋮ Small subgraphs in random graphs and the power of multiple choices ⋮ Aggregation models with limited choice and the multiplicative coalescent ⋮ Coloring the edges of a random graph without a monochromatic giant component ⋮ Phase transition of the minimum degree random multigraph process ⋮ Offline thresholds for Ramsey-type games on random graphs ⋮ Hamiltonicity thresholds in Achlioptas processes ⋮ Avoiding small subgraphs in Achlioptas processes ⋮ Ramsey games with giants ⋮ Susceptibility in subcritical random graphs ⋮ A phase transition for avoiding a giant component ⋮ Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process ⋮ The triangle-free process ⋮ Bounded-Size Rules: The Barely Subcritical Regime ⋮ The Bohman-Frieze process near criticality ⋮ Delaying satisfiability for random 2SAT ⋮ The Phase Transition in Multitype Binomial Random Graphs ⋮ Unnamed Item ⋮ On the normality of giant components
Cites Work
This page was built for publication: Birth control for giants
