Percolation of arbitrary words on the close-packed graph of ℤ2

Electronic Journal of Probability

Volumn 6, Issue , 2001, Pages 1-27

  Zhang, Y ^c   Sidoravicius, V ^b  

^a Department of Obstetrics Gynecology   (United States)

^b IMPA   (Brazil)

^c UNIVERSITY OF COLORADO   (United States)

Author keywords

Close packing; Percolation

Indexed keywords

EID: 10644293194     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v6-77     Document Type: Article

References (9)

1. N, Ann. Probab. 23, 1024-1060.
2. van den Berg, J. and Ermakov, A. (1996), A new lower bound for the critical probability of site percolation on the square lattice, Random Structures and Algorithms 8, 199-212.
3. Grimmett, G. R. (1999), Percolation, 2nd ed., Springer-Verlag, Berlin.
4. Harris, T. E. (1960), A lower bound for the critical probability in a certain percolation process, Proc. Cambr. Phil. Soc. 56, 13-20.
5. Kesten, H. (1982), Percolation Theory for Mathematicians, Birkhauser Boston.
6. Kesten, H., Sidoravicius, V. and Zhang, Y. (1998), Almost all words are seen in critical, site percolation on the triangular lattice, Elec. J. Probab. 3, 1-75.
7. Newman, M. H. A. (1951), Elements of the Topology of Plane Sets of Points, seconded., Cambr. Univ. Press.
8. Russo, L. (1981) On the critical percolation probabilities, Z. Wahrsch. verw. Gebiete 56, 229-237.
9. Smythe, R. T. and Wierman, J. C. (1978), First-passage Percolation on the Square Lattice, Lecture Notes in Mathematics, vol 671, Springer-Verlag.