Bootstrap percolation on the random regular graph

Random Structures and Algorithms

Volumn 30, Issue 1-2, 2007, Pages 257-286

  Balogh, József ^a   Pittel, Boris G ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Cellular automata; Percolation; Random regular graph

Indexed keywords

EID: 33846696533     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20158     Document Type: Conference Paper

References (29)

1. M. Aizenman and J. L. Lebowitz, Metastability effects in bootstrap percolation, J Phys A 21 (1988), 3801-3813.
2. D. Aldous and B. G. Pittel, On a random graph with immigrating vertices: Emergence of the giant component, Random Struct Algorithm 17 (2000), 79-102.
3. J. Aronson, A. Frieze, and B. G. Pittel, Maximum matchings in sparse random graphs: Karp-Sipser revisited, Random Struct Algorithm 12 (1998), 111-177.
4. J. Balogh and B. Bollobás, Sharp thresholds in bootstrap percolation, J Phys A 326 (2003), 305-312.
5. J. Balogh and B. Bollobás, Bootstrap percolation on the hypercube, Probab Theory Relat Field 134 (2006), 624-648.
6. J. Balogh, Y. Peres, and G. Pete, Bootstrap percolation on infinite trees and non-amenable groups, Combinatorics, Probability Comp 15 (2006), 715-730.
7. J. Balogh and G. Pete, Random disease on the square grid, Random Struct Algorithm 13 (1998), 409-422.
8. E. Bender and R. Canfield, The asymptotic number of labelled graphs with given degree sequences, J Comb Theory Ser A 24 (1978), 296-307.
9. E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning ways for your mathematical plays, Vol. 2, Academic Press, London, 1982.
10. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, Eur J Combinator 1 (1980), 311-316.
11. B. Bollobás, The isoperimetric number of random regular graphs, Eur J Combinator 9 (1988), 241-244.
12. B. Bollobás and W. Fernandez de la Vega, The diameter of random regular graphs, Combinatorica 2 (1982), 125-134.
13. A. W. Burks (Editor), Essays on cellular automata, University of Illinois Press, 1970.
14. R. Cerf and F. Manzo, The threshold regime of finite volume bootstrap percolation, Stochastic Process Appl 101 (2002), 69-82.
15. J. Chalupa, G. R. Reich, and P. L. Leath, Bootstrap percolation on a Bethe Lattice, J Phys C 12 (1979), L31-L35.
16. R. Durrett, Probability: theory and examples, 2nd edition, Duxbury Press, Belmont, CA. xiii+503 pp, 1996.
17. E. Friedgut and G. Kalai, Every monotone graph property has a sharp threshold, Proc Amer Math Soc 124 (1996), 2993-3002.
18. M. Gardner, Wheels, life and other mathematical amusements, W. H. Freeman and Co., San Francisco, CA, 1983.
19. G. R. Glimmett, Percolation, 2nd edition, Springer-Verlag, Berlin, 1999.
20. A. E. Holroyd, Sharp metastability threshold for two-dimensional bootstrap percolation, Probab Theory Relat Field 125 (2003), 195-224.
21. R. M. Karp and M. Sipser, "Maximum matchings in sparse random graphs," Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computing, 1981, pp. 364-375.
22. T. M. Liggett, "Interacting particle systems," In Classics in mathematics, Springer-Verlag, Berlin. 2005. xvi+496 pp. Reprint of the 1985 original.
23. W. S. McCulloch and W. Pitt, A logical calculus of ideas immanent in nervous activity, Bull Math Biophy 5 (1943), 115-133.
24. B. G. Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giant k-core in a random graph, J Combin Theory Ser B 67 (1996), 111-151.
25. R. H. Schonmann, On the behavior of some cellular automata related to bootstrap percolation, Ann Probab 20 (1992), 174-193.
26. S. Ulam, "Random processes and transformations", In Proceedings of the International Congress of Mathematicians, Cambridge, MA, 1950., Amer Math Soc, Providence, R.I, 2 (1952), 264-275.
27. A. C. D. van Enter, Proof of Straley's argument for bootstrap percolation, J Statist Phys 48 (1987), 943-945.
28. N. Wormald, The asymptotic connectivity of labelled regular graphs, J Comb Theory Ser B 31 (1981), 156-167.
29. N. Wormald, The asymptotic distribution of short cycles in random regular graphs, J Comb Theory Ser B 31 (1981), 168-182.