Bootstrap percolation in random geometric graphs
Victor Falgas-Ravry, Amites Sarkar

TL;DR
This paper analyzes bootstrap percolation on random geometric graphs on a 2D torus, identifying conditions for global infection spread or containment, and explores related 1D models and open problems.
Contribution
It provides new thresholds and conditions for infection spread in geometric graphs, extending bootstrap percolation theory to spatially embedded networks.
Findings
Global infection occurs if < (1+p)/2.
Infection remains localized if > (1+p)/2.
Bounds on parameters for large outbreaks and isolated infected regions.
Abstract
Following Bradonji\'c and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the -dimensional torus. In this model, the expected number of vertices of the graph is , and the expected degree of a vertex is for some fixed . Each vertex is added with probability to a set of initially infected vertices. Vertices subsequently become infected if they have at least infected neighbours. Here are taken to be fixed constants. We show that if , then a sufficiently large local outbreak leads with high probability to the infection spreading globally, with all but vertices eventually becoming infected. On the other hand, for , even if one adversarially infects every vertex inside a ball of radius , with high probability the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Complex Network Analysis Techniques
