Bootstrap percolation on geometric inhomogeneous random graphs

Abstract

Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process modelling the spread of an infection of vertices starting within a (small) local region. We show that the process exhibits a phase transition in terms of the initial infection rate in this region. We determine the speed of the process in the supercritical case, up to lower order terms, and show that its evolution is fundamentally influenced by the underlying geometry. For vertices with given position and expected degree, we determine the infection time up to lower order terms. Finally, we show how this knowledge can be used to contain the infection locally by removing relatively few edges from the graph. This is the first time that the role of geometry on bootstrap percolation is analysed mathematically for geometric scale-free networks.

(Biased) Majority Rule Cellular Automata

“…Moreover, Mitsche and et al [13] considered α = (d(v) + α )/2; they proved for any integer α , there exists a family of regular graphs such that with high probability all vertices become blue at the end. Recently, Koch and Lengler [12] mathematically analyzed the role of geometry on bootstrap percolation for geometric scale-free networks.…”