Graph bootstrap percolation -- a discovery of slowness
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911519205228544 |
|---|---|
| author | Fabian, David Morris, Patrick Szabó, Tibor |
| author_facet | Fabian, David Morris, Patrick Szabó, Tibor |
| contents | Graph bootstrap percolation is a discrete-time process capturing the spread of a virus on the edges of $K_n$. Given an initial set $G\subseteq K_n$ of infected edges, the transmission of the virus is governed by a fixed graph $H$: in each round of the process any edge $e$ of $K_n$ that is the last uninfected edge in a copy of $H$ in $K_n$ gets infected as well. Once infected, edges remain infected forever. The process was introduced by Bollobás in 1968 in the context of weak saturation and has since inspired a vast array of beautiful mathematics. The main focus of this survey is the extremal question of how long the infection process can last before stabilising. We give an exposition of our recent systematic study of this maximum running time and the influence of the infection rule $H$. The topic turns out to possess a wide variety of interesting behaviour, with connections to additive, extremal and probabilistic combinatorics. Along the way we encounter a number of surprises and attractive open problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_12736 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Graph bootstrap percolation -- a discovery of slowness Fabian, David Morris, Patrick Szabó, Tibor Combinatorics Probability Graph bootstrap percolation is a discrete-time process capturing the spread of a virus on the edges of $K_n$. Given an initial set $G\subseteq K_n$ of infected edges, the transmission of the virus is governed by a fixed graph $H$: in each round of the process any edge $e$ of $K_n$ that is the last uninfected edge in a copy of $H$ in $K_n$ gets infected as well. Once infected, edges remain infected forever. The process was introduced by Bollobás in 1968 in the context of weak saturation and has since inspired a vast array of beautiful mathematics. The main focus of this survey is the extremal question of how long the infection process can last before stabilising. We give an exposition of our recent systematic study of this maximum running time and the influence of the infection rule $H$. The topic turns out to possess a wide variety of interesting behaviour, with connections to additive, extremal and probabilistic combinatorics. Along the way we encounter a number of surprises and attractive open problems. |
| title | Graph bootstrap percolation -- a discovery of slowness |
| topic | Combinatorics Probability |
| url | https://arxiv.org/abs/2602.12736 |