## The Annals of Applied Probability

### A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs

#### Abstract

A bootstrap percolation process on a graph with infection threshold $r\ge1$ is a dissemination process that evolves in time steps. The process begins with a subset of infected vertices and in each subsequent step every uninfected vertex that has at least $r$ infected neighbours becomes infected and remains so forever.

Critical phenomena in bootstrap percolation processes were originally observed by Aizenman and Lebowitz in the late 1980s as finite-volume phase transitions in $\mathbb{Z}^{d}$ that are caused by the accumulation of small local islands of infected vertices. They were also observed in the case of dense (homogeneous) random graphs by Janson et al. [Ann. Appl. Probab. 22 (2012) 1989–2047]. In this paper, we consider the class of inhomogeneous random graphs known as the Chung-Lu model: each vertex is equipped with a positive weight and each pair of vertices appears as an edge with probability proportional to the product of the weights. In particular, we focus on the sparse regime, where the number of edges is proportional to the number of vertices.

The main results of this paper determine those weight sequences for which a critical phenomenon occurs: there is a critical density of vertices that are infected at the beginning of the process, above which a small (sublinear) set of infected vertices creates an avalanche of infections that in turn leads to an outbreak. We show that this occurs essentially only when the tail of the weight distribution dominates a power law with exponent 3 and we determine the critical density in this case.

#### Article information

Source
Ann. Appl. Probab., Volume 28, Number 2 (2018), 990-1051.

Dates
Revised: February 2017
First available in Project Euclid: 11 April 2018

https://projecteuclid.org/euclid.aoap/1523433630

Digital Object Identifier
doi:10.1214/17-AAP1324

Mathematical Reviews number (MathSciNet)
MR3784494

Zentralblatt MATH identifier
06897949

#### Citation

Fountoulakis, Nikolaos; Kang, Mihyun; Koch, Christoph; Makai, Tamás. A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs. Ann. Appl. Probab. 28 (2018), no. 2, 990--1051. doi:10.1214/17-AAP1324. https://projecteuclid.org/euclid.aoap/1523433630

#### References

• Abdullah, M. A. and Fountoulakis, N. (2014). A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs. Random Structures Algorithms. To appear. Available at http://arxiv.org/abs/1402.2815.
• Adler, J. and Lev, U. (2003). Bootstrap percolation: Visualizations and applications. Braz. J. Phys. 33 641–644.
• Aizenman, M. and Lebowitz, J. L. (1988). Metastability effects in bootstrap percolation. J. Phys. A 21 3801–3813.
• Amini, H. (2010a). Bootstrap percolation in living neural networks. J. Stat. Phys. 141 459–475.
• Amini, H. (2010b). Bootstrap percolation and diffusion in random graphs with given vertex degrees. Electron. J. Combin. 17 Research Paper 25.
• Amini, H. and Fountoulakis, N. (2014). Bootstrap percolation in power-law random graphs. J. Stat. Phys. 155 72–92.
• Amini, H., Fountoulakis, N. and Panagiotou, K. (2014). Bootstrap percolation in inhomogeneous random graphs. Preprint. Available at http://arxiv.org/abs/1402.2815.
• Balogh, J. and Bollobás, B. (2006). Bootstrap percolation on the hypercube. Probab. Theory Related Fields 134 624–648.
• Balogh, J., Bollobás, B. and Morris, R. (2009). Bootstrap percolation in three dimensions. Ann. Probab. 37 1329–1380.
• Balogh, J., Peres, Y. and Pete, G. (2006). Bootstrap percolation on infinite trees and non-amenable groups. Combin. Probab. Comput. 15 715–730.
• Balogh, J. and Pete, G. (1998). Random disease on the square grid. Proceedings of the Eighth International Conference “Random Structures and Algorithms” (Poznan, 1997). Random Structures Algorithms 13 409–422.
• Balogh, J. and Pittel, B. G. (2007). Bootstrap percolation on the random regular graph. Random Structures Algorithms 30 257–286.
• Balogh, J., Bollobás, B., Duminil-Copin, H. and Morris, R. (2012). The sharp threshold for bootstrap percolation in all dimensions. Trans. Amer. Math. Soc. 36 2667–2701.
• Bollobás, B., Janson, S. and Riordan, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31 3–122.
• Bollobás, B., Gunderson, K., Holmgren, C., Janson, S. and Przykucki, M. (2014). Bootstrap percolation on Galton–Watson trees. Electron. J. Probab. 19 1–27.
• Candellero, E. and Fountoulakis, N. (2016). Bootstrap percolation and the geometry of complex networks. Stochastic Process. Appl. 126 234–264.
• Cerf, R. and Manzo, F. (2002). The threshold regime of finite volume bootstrap percolation. Stochastic Process. Appl. 101 69–82.
• Chalupa, J., Leath, P. L. and Reich, G. R. (1979). Bootstrap percolation on a Bethe lattice. J. Phys. C, Solid State Phys. 12 L31–L35.
• Chung, F. and Lu, L. (2002). Connected components in random graphs with given expected degree sequences. Ann. Comb. 6 125–145.
• Chung, F. and Lu, L. (2003). The average distance in a random graph with given expected degrees. Internet Math. 1 91–113.
• Chung, F., Lu, L. and Vu, V. (2004). The spectra of random graphs with given expected degrees. Internet Math. 1 257–275.
• Ebrahimi, R., Gao, J., Ghasemiesfeh, G. and Schoenebeck, G. (2017). How complex contagions spread quickly in the preferential attachment model and other time-evolving networks. IEEE Trans. Netw. Sci. Eng. PP:99.
• Enter, A. C. D. V. (1987). Proof of Straley’s argument for bootstrap percolation. J. Stat. Phys. 48 943–945.
• Fontes, L. and Schonmann, R. (2008). Bootstrap percolation on homogeneous trees has 2 phase transitions. J. Stat. Phys. 132 839–861.
• Fontes, L. R., Schonmann, R. H. and Sidoravicius, V. (2002). Stretched exponential fixation in stochastic Ising models at zero temperature. Comm. Math. Phys. 228 495–518.
• Holroyd, A. E. (2003). Sharp metastability threshold for two-dimensional bootstrap percolation. Probab. Theory Related Fields 125 195–224.
• Janson, S., Łuczak, T. and Ruciński, A. (2000). Random Graphs. Wiley-Interscience, New York.
• Janson, S., Łuczak, T., Turova, T. and Vallier, T. (2012). Bootstrap percolation on the random graph $G_{n,p}$. Ann. Appl. Probab. 22 1989–2047.
• Karbasi, A., Lengler, J. and Steger, A. (2015). Normalization phenomena in asynchronous networks. In Automata, Languages, and Programming. Part II. Lecture Notes in Computer Science 9135 688–700. Springer, Heidelberg.
• Koch, C. and Lengler, J. (2016). Bootstrap percolation on geometric inhomogeneous random graphs. Preprint. Available at http://arxiv.org/abs/1603.02057.
• McDiarmid, C. (1998). Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics. Algorithms Combin. 16 195–248. Springer, Berlin.
• Morris, R. (2009). Zero-temperature Glauber dynamics on $\mathbb{Z}^{d}$. Probab. Theory Related Fields 149 417–434.
• Pittel, B., Spencer, J. and Wormald, N. (1996). Sudden emergence of a giant $k$-core in a random graph. J. Combin. Theory Ser. B 67 111–151.
• Sabhapandit, S., Dhar, D. and Shukla, P. (2002). Hysteresis in the random-field Ising model and bootstrap percolation. Phys. Rev. Lett. 88 197202.
• Sausset, F., Toninelli, C., Biroli, G. and Tarjus, G. (2010). Bootstrap percolation and kinetically constrained models on hyperbolic lattices. J. Stat. Phys. 138 411–430.
• Schonmann, R. H. (1992). On the behavior of some cellular automata related to bootstrap percolation. Ann. Probab. 20 174–193.
• Söderberg, B. (2002). General formalism for inhomogeneous random graphs. Phys. Rev. E 66 066121.
• Tlusty, T. and Eckmann, J.-P. (2009). Remarks on bootstrap percolation in metric networks. J. Phys. A 42 205004.
• Toninelli, C., Biroli, G. and Fisher, D. S. (2006). Jamming percolation and glass transitions in lattice models. Phys. Rev. Lett. 96 035702.
• Williams, D. (1991). Probability with Martingales. Cambridge Univ. Press, Cambridge.