2023/09/22 by Hudson LaFayette, LaFayette, Hudson, Rayan Ibrahim +3
Mathematics · Physics and Astronomy · #05C12 #05C35 #05C40 #Combinatorics (math.CO) #Complex Network Analysis Techniques #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.2309.13138
openalex publication_date 2023/09/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Bootstrap Percolation is a process defined on a graph which begins with an initial set of infected vertices. In each subsequent round, an uninfected vertex becomes infected if it is adjacent to at least r previously infected vertices. If an initially infected set of vertices, A0, begins a process in which every vertex of the graph eventually becomes infected, then we say that A0 percolates. In this paper we investigate bootstrap percolation as it relates to graph distance and connectivity. We find a sufficient condition for the existence of cardinality 2 percolating sets in diameter 2 graphs when r = 2. We also investigate connections between connectivity and bootstrap percolation and lower and upper bounds on the number of rounds to percolation in terms of invariants related to graph distance.