Related Experiment Video
Updated: Oct 15, 2025

Designing Automated, High-throughput, Continuous Cell Growth Experiments Using eVOLVER
Published on: May 19, 2019
Large Deviations for Subcritical Bootstrap Percolation on the Erdős-Rényi Graph
1Department of Mathematics, University of British Columbia, Vancouver, BC Canada.
Abstract:
We study atypical behavior in bootstrap percolation on the Erdős-Rényi random graph. Initially a set S is infected. Other vertices are infected once at least r of their neighbors become infected. Janson et al. (Ann Appl Probab 22(5):1989-2047, 2012) locates the critical size of S, above which it is likely that the infection will spread almost everywhere. Below this threshold, a central limit theorem is proved for the size of the eventually infected set. In this work, we calculate the rate function for the event that a small set S eventually infects an unexpected number of vertices, and identify the least-cost trajectory realizing such a large deviation.
Insights
This study analyzes bootstrap percolation on random graphs, revealing the probability of widespread infection from small initial sets. We identify the most efficient infection pathways for unexpected large-scale spread.
Area of Science:
- Probability theory
- Statistical physics
- Network science
Background:
- Bootstrap percolation models infection spread on graphs.
- Erdős-Rényi random graphs are a fundamental model for network structure.
- Previous work established critical conditions for widespread infection.
Purpose of the Study:
- Investigate atypical, large-deviation events in bootstrap percolation.
- Quantify the probability of unexpected infection spread from small initial sets.
- Identify the most efficient pathways for such large deviations.
Main Methods:
- Analysis of bootstrap percolation dynamics on Erdős-Rényi random graphs.
- Large deviation theory to calculate rate functions.
- Identification of minimum-cost trajectories for rare events.
Main Results:
- Calculated the rate function for small initial sets causing unexpected large infections.
- Identified the least-cost trajectory for realizing these large deviations.
- Characterized the probability of rare, extensive infection spread.
Conclusions:
- Provides a deeper understanding of extreme events in random network percolation.
- Offers insights into the dynamics of rare but significant spread phenomena.
- Contributes to the statistical analysis of complex systems.
More Related Videos
Related Concept Videos
Wald-Wolfowitz Runs Test II
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
Entropy Change in Reversible Processes
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
Bootstrapping
Chebyshev's Theorem to Interpret Standard Deviation
Quantifying and Rejecting Outliers: The Grubbs Test
Unusual Results
According to the range rule of thumb, any value above or below two standard deviations, 2σ from the mean, μ is considered unusual.
Maximum unusual value =...

