Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
×
Home
  • Home
Article
  • Cited by 19
  • Cited by
    Crossref Citations
    Crossref logo
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.
    Morrison, Natasha and Noel, Jonathan A. 2018. Extremal bounds for bootstrap percolation in the hypercube. Journal of Combinatorial Theory, Series A, Vol. 156, Issue. , p. 61.
    Gärtner, Bernd and Zehmakan, Ahad N. 2018. LATIN 2018: Theoretical Informatics. Vol. 10807, Issue. , p. 572.
    Morrison, Natasha and Noel, Jonathan A. 2017. Extremal Bounds for Bootstrap Percolation in the Hypercube. Electronic Notes in Discrete Mathematics, Vol. 61, Issue. , p. 877.
    Morris, Robert 2017. Bootstrap percolation, and other automata. European Journal of Combinatorics, Vol. 66, Issue. , p. 250.
    Mitsche, Dieter Pérez-Giménez, Xavier and Prałat, Paweł 2017. Strong-majority bootstrap percolation on regular graphs with low dissemination threshold. Stochastic Processes and their Applications, Vol. 127, Issue. 9, p. 3110.
    Gärtner, Bernd and N. Zehmakan, Ahad 2017. Language and Automata Theory and Applications. Vol. 10168, Issue. , p. 393.
    Mora, Fernando Urbina, Felipe Cortez, Vasco and Rica, Sergio 2016. Nonlinear Dynamics: Materials, Theory and Experiments. Vol. 173, Issue. , p. 329.
    Bradonjić, Milan and Wagner, Stephan 2016. Algorithms and Models for the Web Graph. Vol. 10088, Issue. , p. 47.
    BOLLOBÁS, BÉLA SMITH, PAUL and UZZELL, ANDREW 2015. Monotone Cellular Automata in a Random Environment. Combinatorics, Probability and Computing, Vol. 24, Issue. 04, p. 687.
    Kiwi, M. Moisset de Espanés, P. Rapaport, I. Rica, S. and Theyssier, G. 2014. Strict Majority Bootstrap Percolation in the r-wheel. Information Processing Letters, Vol. 114, Issue. 6, p. 277.
    Chang, Ching-Lueh and Lyuu, Yuh-Dauh 2013. Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades. Theoretical Computer Science, Vol. 468, Issue. , p. 37.
    Gravner, Janko Holroyd, Alexander E. and Morris, Robert 2012. A sharper threshold for bootstrap percolation in two dimensions. Probability Theory and Related Fields, Vol. 153, Issue. 1-2, p. 1.
    Reichman, Daniel 2012. New bounds for contagious sets. Discrete Mathematics, Vol. 312, Issue. 10, p. 1812.
    Balogh, József Bollobás, Béla and Morris, Robert 2012. Graph bootstrap percolation. Random Structures & Algorithms, Vol. 41, Issue. 4, p. 413.
    Kulich, Tomáš 2012. The diameter of a random subgraph of the hypercube. Random Structures & Algorithms, Vol. 41, Issue. 2, p. 282.
    Chang, Ching-Lueh 2011. Triggering cascades on undirected connected graphs. Information Processing Letters, Vol. 111, Issue. 19, p. 973.
    Morris, Robert 2011. Zero-temperature Glauber dynamics on $${\mathbb{Z}^d}$$. Probability Theory and Related Fields, Vol. 149, Issue. 3-4, p. 417.
    BALOGH, JÓZSEF BOLLOBÁS, BÉLA and MORRIS, ROBERT 2010. Bootstrap Percolation in High Dimensions. Combinatorics, Probability and Computing, Vol. 19, Issue. 5-6, p. 643.
    Biskup, Marek and Schonmann, Roberto H. 2009. Metastable Behavior for Bootstrap Percolation on Regular Trees. Journal of Statistical Physics, Vol. 136, Issue. 4, p. 667.
    ×
  • Get access
    Add to cart USD35.00
    Check if you have access via personal or institutional login
    Log in Register Recommend to librarian

Majority Bootstrap Percolation on the Hypercube

  • JÓZSEF BALOGH (a1), BÉLA BOLLOBÁS (a2) and ROBERT MORRIS (a3)
Abstract

In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain infected forever. We say that percolation occurs if eventually every vertex is infected.

The elements of the set of initially infected vertices, A ⊂ V(G), are normally chosen independently at random, each with probability p, say. This process has been extensively studied on the sequence of torus graphs [n]d, for n = 1,2, . . ., where d = d(n) is either fixed or a very slowly growing function of n. For example, Cerf and Manzo [17] showed that the critical probability is o(1) if d(n) ≤ log*n, i.e., if p = p(n) is bounded away from zero then the probability of percolation on [n]d tends to one as n → ∞.

In this paper we study the case when the growth of d to ∞ is not excessively slow; in particular, we show that the critical probability is 1/2 + o(1) if d ≥ (log log n)2 log log log n, and give much stronger bounds in the case that G is the hypercube, [2]d.

Copyright
COPYRIGHT: © Cambridge University Press 2008
References
Hide All
[1]Adler, J. and Lev, U. (2003) Bootstrap percolation: Visualizations and applications. Braz. J. Phys. 33 641–644.
[2]Aizenman, M.. and Lebowitz, J. L. (1988) Metastability effects in bootstrap percolation. J. Phys. A 21 3801–3813.
[3]Ajtai, M., Komlós, J. and Szemerédi, E. (1982) Largest random component of a k-cube. Combinatorica 2 1–7.
[4]Balister, P., Bollobás, B., Johnson, R. and Walters, M. (2003) Random majority percolation. Random Struct. Alg., Submitted.
[5]Balogh, J. and Bollobás, B. (2006) Bootstrap percolation on the hypercube. Probab. Theory Rel. Fields 134 624–648.
[6]Balogh, J., Bollobás, B. and Morris, R. Majority bootstrap percolation on the hypercube. arXiv.org/abs/math/0702373.
[7]Balogh, J., Bollobás, B. and Morris, R. Bootstrap percolation in three dimensions. Submitted.
[8]Balogh, J., Bollobás, B. and Morris, R. The sharp threshold for r-neighbour bootstrap percolation. In preparation.
[9]Balogh, J., Bollobás, B. and Morris, R. Bootstrap percolation on [n]d. In preparation.
[10]Balogh, J., Peres, Y. and Pete, G. (2006) Bootstrap percolation on infinite trees and non-amenable groups. Combin. Probab. Comput. 15 715–730.
[11]Balogh, J. and Pittel, B. (2007) Bootstrap percolation on random regular graphs. Random Struct. Alg. 30 257–286.
[12]Baranyai, Z. (1975) On the factorization of the complete uniform hypergraph. In Infinite and Finite Sets (Colloq. Keszthely, 1973; dedicated to P. Erd Hos on his 60th birthday), Vol. I, pp. 91–108.
[13]Bollobás, B. (2001) Random Graphs, 2nd edn, Cambridge University Press.
[14]Bollobás, B., Kohayakawa, Y. and Luczak, T. (1992) The evolution of random subgraphs of the cube. Random Struct. Alg. 3 55–90.
[15]Borgs, C., Chayes, J. T., vander Hofstad, R. der Hofstad, R., Slade, G. and Spencer, J. (2006) Random subgraphs of finite graphs III: The phase transition for the n-cube. Combinatorica 26 395–410.
[16]Cerf, R. and Cirillo, E. N. M. (1999) Finite size scaling in three-dimensional bootstrap percolation. Ann. Probab. 27 1837–1850.
[17]Cerf, R. and Manzo, F. (2002) The threshold regime of finite volume bootstrap percolation. Stochastic Proc. Appl. 101 69–82.
[18]Chalupa, J., Leath, P. L. and Reich, G. R. (1979) Bootstrap percolation on a Bethe lattice. J. Phys. C 12 L31–L35.
[19]ErdHos, P. Hos, P. and Spencer, J. (1979) Evolution of the n-cube. Comput. Math. Appl. 5 33–39.
[20]Fontes, L. R., Schonmann, R. H. and Sidoravicius, V. (2002) Stretched exponential fixation in stochastic Ising models at zero temperature. Commun. Math. Phys. 228 495–518.
[21]vander Hofstad, R. der Hofstad, R. and Slade, G. (2005) Asymptotic expansion in n −1 for percolation critical values on the n-cube and Z n. Random Struct. Alg. 27 331–357.
[22]vander Hofstad, R. der Hofstad, R. and Slade, G. (2006) Expansion in n −1 for percolation critical values on the n-cube and Z n: The first three terms. Combin. Probab. Comput. 15 695–713.
[23]Holroyd, A. (2003) Sharp metastability threshold for two-dimensional bootstrap percolation. Probab. Theory Rel. Fields 125 195–224.
[24]Leighton, T. and Plaxton, C. G. (1998) Hypercubic sorting networks. SIAM J. Comput. 27 1–47.
[25]McCulloch, W. S. and Pitts, W. (1943) A logical calculus of ideas immanent in nervous activity. Bull. Math. Biophys. 5 115–133.
[26]Morris, R. Glauber dynamics in high dimensions. Submitted.
[27]Nanda, S., Newman, C. M. and Stein, D. (2000) Dynamics of Ising spin systems at zero temperature. In On Dobrushin's way (From Probability Theory to Statistical Mechanics (R. Minlos, S. Shlosman and Y. Suhov, eds). Amer. Math. Soc. Transl. (2) 198 183–194.
[28]Newman, C. M. and Stein, D. (2000) Zero-temperature dynamics of Ising spin systems following a deep quench: Results and open problems. Physica A 279 159–168.
[29]Schonmann, R. H. (1990) Finite size scaling behavior of a biased majority rule cellular automaton. Physica A 167 619–627.
[30]Schonmann, R. H. (1992) On the behaviour of some cellular automata related to bootstrap percolation. Ann. Probab. 20 174–193.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

CAPTCHA *

Skip to the audio challenge
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 24 *
Loading metrics...

Abstract views

Total abstract views: 269 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 13th June 2018. This data will be updated every 24 hours.

Cancel
Confirm
×