Bootstrap percolation on the hypercube
- 223 Downloads
In the bootstrap percolation on the n-dimensional hypercube, in the initial position each of the 2 n sites is occupied with probability p and empty with probability 1−p, independently of the state of the other sites. Every occupied site remains occupied for ever, while an empty site becomes occupied if at least two of its neighbours are occupied. If at the end of the process every site is occupied, we say that the (initial) position spans the hypercube. We shall show that there are constants c 1,c 2>0 such that for Open image in new window the probability of spanning tends to 1 as n→∞, while for Open image in new window the probability tends to 0. Furthermore, we shall show that for each n the transition has a sharp threshold function.
KeywordsStochastic Process Probability Theory Initial Position Mathematical Biology Threshold Function
Unable to display preview. Download preview PDF.
- 5.Balogh, J.: Graph Parameters and Bootstrap Percolation, Ph.D. Dissertation, Memphis, 2001 MayGoogle Scholar
- 9.Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays. Vol. 2, Academic Press. London, 1982Google Scholar
- 10.Bollobás, B.: Random Graphs. 2nd edition, Cambridge University Press, Cambridge, 2001, xviii + 498 pp.Google Scholar
- 11.Burks, A.W. (ed.): Essays on Cellular Automata. University of Illinois Press, 1970Google Scholar
- 18.Gardner, M.: Wheels, Life and Other Mathematical Amusements. W. H. Freeman and Co., 1983Google Scholar
- 26.Ulam, S.: Random processes and transformations. In: Proceedings of the International Congress of Mathematicians. Cambridge, Mass., 1950, Am. Math. Soc., Providence, R.I., 2, 264–275 (1952)Google Scholar