A sharp threshold for bootstrap percolation in a random hypergraph
From MaRDI portal
Publication:2042875
DOI10.1214/21-EJP650zbMath1479.60199arXiv1806.02903OpenAlexW3173681176MaRDI QIDQ2042875
Jonathan A. Noel, Natasha Morrison
Publication date: 21 July 2021
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.02903
Martingales with discrete parameter (60G42) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items
On the running time of hypergraph bootstrap percolation ⋮ Weak saturation numbers of complete bipartite graphs in the clique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear algebra and bootstrap percolation
- Bootstrap percolation in living neural networks
- Bootstrap percolation on the random graph \(G_{n,p}\)
- Bootstrap percolation in three dimensions
- The early evolution of the \(H\)-free process
- The triangle-free process
- An extremal problem for sets with applications to graph theory
- Hyperconnectivity of graphs
- On tail probabilities for martingales
- Random graph processes with maximum degree 2
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Finite size scaling in three-dimensional bootstrap percolation
- The sharp threshold for making squares
- Sharp thresholds for contagious sets in random graphs
- Differential equations for random processes and random graphs
- Bootstrap percolation in power-law random graphs
- Exact bounds for some hypergraph saturation problems
- The threshold regime of finite volume bootstrap percolation.
- A note on the random greedy independent set algorithm
- Graph bootstrap percolation
- A Random Triadic Process
- Metastability effects in bootstrap percolation
- Poisson approximation for large deviations
- Random Graph Processes with Degree Restrictions
- Concentration of non‐Lipschitz functions and applications
- The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
- A natural barrier in random greedy hypergraph matching
- The time of graph bootstrap percolation
- On the Method of Typical Bounded Differences
- Saturation in the Hypercube and Bootstrap Percolation
- The sharp threshold for bootstrap percolation in all dimensions
- Concentration of Measure for the Analysis of Randomized Algorithms
- Concentration of multivariate polynomials and its applications
- Extremal bounds for bootstrap percolation in the hypercube
