Graph bootstrap percolation
From MaRDI portal
Publication:3145835
DOI10.1002/rsa.20458zbMath1279.68243arXiv1107.1381MaRDI QIDQ3145835
József Balogh, Béla Bollobás, Robert Morris
Publication date: 14 December 2012
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1381
05C80: Random graphs (graph-theoretic aspects)
60K35: Interacting random processes; statistical mechanics type models; percolation theory
68Q80: Cellular automata (computational aspects)
Related Items
The Zero Forcing Number of Graphs, Counting restricted orientations of random graphs, Saturation in the Hypercube and Bootstrap Percolation, How to Burn a Graph, Fuzzification of Zero Forcing Process, New ordering methods to construct contagious sets and induced degenerate subgraphs, Burning and \(w\)-burning of geometric graphs, Transitive closure in a polluted environment, On the running time of hypergraph bootstrap percolation, On the number of \(K_4\)-saturating edges, On the maximum running time in graph bootstrap percolation, Bootstrap percolation on the random graph \(G_{n,p}\), Burning grids and intervals, Sharp thresholds for contagious sets in random graphs, Burning numbers of path forests and spiders, A sharp threshold for bootstrap percolation in a random hypergraph, On \(K_{2, t}\)-bootstrap percolation, Large deviations for subcritical bootstrap percolation on the Erdős-Rényi graph, Burning numbers of \(t\)-unicyclic graphs, The sharp \(K_4\)-percolation threshold on the Erdős-Rényi random graph, \(K_{r,s}\) graph bootstrap percolation, Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs, Burning number of theta graphs, Burning a graph is hard, The minimum number of clique-saturating edges
Cites Work
- Unnamed Item
- Unnamed Item
- Linear algebra and bootstrap percolation
- A sharper threshold for bootstrap percolation in two dimensions
- Zero-temperature Glauber dynamics on \({\mathbb{Z}^d}\)
- Bootstrap percolation on the hypercube
- Bootstrap percolation in three dimensions
- Bootstrap percolation on homogeneous trees has 2 phase transitions
- An extremal problem for sets with applications to graph theory
- Threshold functions
- An extremal problem for two families of sets
- On the behavior of some cellular automata related to bootstrap percolation
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Finite size scaling in three-dimensional bootstrap percolation
- Stretched exponential fixation in stochastic Ising models at zero temperature
- Threshold models of diffusion and collective behavior
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Bootstrap percolation on the random regular graph
- Majority Bootstrap Percolation on the Hypercube
- Metastability effects in bootstrap percolation
- Sharp thresholds of graph properties, and the $k$-sat problem
- A simple model of global cascades on random networks
- Integrals, partitions, and cellular automata
- Bootstrap Percolation in High Dimensions
- The sharp threshold for bootstrap percolation in all dimensions
- On generalized graphs
