Bootstrap percolation on the hypercube
By Jozsef Balogh, Béla Bollobás. 2006
144 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/60e1bfcc83468396f3f25e22d174ec3954a85cb9
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Robert Morris
- Béla Bollobás
- Hamed Amini
- Rama Cont
- Andreea Minca
- Abbas Ali Saberi
- Jozsef Balogh
- Svante Janson
In Mathematical Physics
- Abbas Ali Saberi
- H. Duminil-Copin
- Robert Morris
- Béla Bollobás
- Hamed Amini
- Rama Cont
- Andreea Minca
- Svante Janson
Citations in the corpus
- The sharp threshold for bootstrap percolation in all dimensions (2010, methodology): “…in 1979 by Chalupa, Leath and Reich [16] in the context of disordered magnetic systems, and has been studied extensively by mathematicians (see, for example, [2, 4, 8, 13, 31, 39]) and physicists [1, 12, 30, 36], as well as by computer scientists [17, 20] and sociologists [24, 41], amongst others.”
- Recent advances in percolation theory and its applications (2015, background): “Bootstrap percolation has been extensively studied on 2D and 3D lattices [221, 222, 223, 224] (and references therein), including the proof of the existence of a sharp metastability threshold in 2D [221] which has then been generalized to arbitrary d dimensional lattices [222, 223].”
- Bootstrap percolation in three dimensions (2008, unknown): “C O ] 3 1 A ug 2 00 9 The Annals of Probability 2009, Vol. 37, No. 4, 1329–1380 DOI: 10.1214/08-AOP433 c© Institute of Mathematical Statistics, 2009”
- RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS (2011, methodology): “The bootstrap percolation process1 is a diffusion model that has been studied on a variety of graphs (see, e.g., Holroyd 2003; Balogh and Bollobás 2006; Balogh and Pittel 2007; Amini 2010a, b).”
- Majority bootstrap percolation on the random graph G(n,p) (2010, background): “A simple example of the latter is the classical folklore problem to find the minimal percolating set in a two-dimensional grid (i.e., a finite square [n]2 in the square lattice); see Balogh and Pete [13] and Bollobás [18].”