Deterministic bootstrap percolation on trees
DOI10.26493/2590-9770.1344.20CzbMATH Open1497.05240OpenAlexW3206948413WikidataQ113213294 ScholiaQ113213294MaRDI QIDQ5045263FDOQ5045263
Authors: Robert A. Beeler, Rodney Keaton, Frederick Reyes Norwood 
Publication date: 4 November 2022
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/2590-9770.1344.20c
Recommendations
- Bootstrap Percolation on Periodic Trees
- Bootstrap percolation on Galton-Watson trees
- Percolation on random recursive trees
- Percolation on a k-Ary Tree
- Lower bounds for bootstrap percolation on Galton-Watson trees
- Random walks and percolation on trees
- Metastable behavior for bootstrap percolation on regular trees
- Existence and region of critical probabilities in bootstrap percolation on inhomogeneous periodic trees
- \(k\)-independent percolation on trees
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Largest and smallest minimal percolating sets in trees
- Sharp metastability threshold for two-dimensional bootstrap percolation
- The sharp threshold for bootstrap percolation in all dimensions
- Title not available (Why is that?)
- Bootstrap percolation on the random graph \(G_{n,p}\)
- Bootstrap percolation on the hypercube
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Random disease on the square grid
- Minimal percolating sets in bootstrap percolation
- New bounds for contagious sets
- Title not available (Why is that?)
- Bootstrap percolation on the random regular graph
- On percolation in random graphs with given vertex degrees
- Extremal bounds for bootstrap percolation in the hypercube
- Contagious Sets in Expanders
- Contagious sets in random graphs
- Contagious sets in dense graphs
- Minimum degree conditions for small percolating sets in bootstrap percolation
- Tight bounds on the minimum size of a dynamic monopoly
- Dynamic monopolies in two-way bootstrap percolation
- Lower bounds for graph bootstrap percolation via properties of polynomials
Cited In (8)
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Percolation on a k-Ary Tree
- Existence and region of critical probabilities in bootstrap percolation on inhomogeneous periodic trees
- Largest and smallest minimal percolating sets in trees
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Frozen percolation on the binary tree is nonendogenous
- The algebraic method in tree percolation
- Bootstrap Percolation on Periodic Trees
This page was built for publication: Deterministic bootstrap percolation on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045263)
