The sharp \(K_4\)-percolation threshold on the Erdős-Rényi random graph

DOI10.1214/21-EJP710zbMath1483.05160OpenAlexW4210736731MaRDI QIDQ2076649

Brett Kolesnik

Publication date: 22 February 2022

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/21-ejp710

zbMATH Keywords

random graphtriadic closureweak saturationbootstrap percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (2)

Transitive closure in a polluted environment ⋮ On the running time of hypergraph bootstrap percolation

Cites Work

• Unnamed Item
• Unnamed Item
• Bootstrap percolation on the random graph \(G_{n,p}\)
• Sharp metastability threshold for two-dimensional bootstrap percolation
• Sharp thresholds for contagious sets in random graphs
• Large deviations for subcritical bootstrap percolation on the Erdős-Rényi graph
• Graph bootstrap percolation
• Metastability effects in bootstrap percolation

This page was built for publication: The sharp \(K_4\)-percolation threshold on the Erdős-Rényi random graph