Weakly saturated random graphs

DOI10.1002/RSA.21210MaRDI QIDQ6641059

Brett Kolesnik, Zsolt Bartha

Publication date: 20 November 2024

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

zbMATH Keywords

random graphweak saturationbootstrap percolation

Mathematics Subject Classification ID

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

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?)
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Hypergraph containers
• On the behavior of some cellular automata related to bootstrap percolation
• Sharp metastability threshold for two-dimensional bootstrap percolation
• Sharp thresholds for contagious sets in random graphs
• Proof of Straley's argument for bootstrap percolation.
• On \(K_{2, t}\)-bootstrap percolation
• Large deviations for subcritical bootstrap percolation on the Erdős-Rényi graph
• The sharp \(K_4\)-percolation threshold on the Erdős-Rényi random graph
• \(K_{r,s}\) graph bootstrap percolation
• The probabilistic method
• Graph bootstrap percolation
• Inequalities with applications to percolation and reliability
• Metastability effects in bootstrap percolation
• Independent sets in hypergraphs
• The sharp threshold for bootstrap percolation in all dimensions

Related Items (1)

\(H\)-percolation with a random \(H\)

This page was built for publication: Weakly saturated random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641059)