Electronic Journal of Probability

Almost All Words Are Seen In Critical Site Percolation On The Triangular Lattice

Harry Kesten, Vladas Sidoravicius, and Yu Zhang

Full-text: Open access

Abstract

We consider critical site percolation on the triangular lattice, that is, we choose $X(v) = 0$ or 1 with probability 1/2 each, independently for all vertices $v$ of the triangular lattice. We say that a word $(\xi_1, \xi_2,\dots) \in \{0,1\}^{\Bbb N}$ is seen in the percolation configuration if there exists a selfavoiding path $(v_1, v_2, \dots)$ on the triangular lattice with $X(v_i) = \xi_i, i \ge 1$. We prove that with probability 1 "almost all" words, as well as all periodic words, except the two words $(1,1,1, \dots)$ and $(0,0,0,\dots)$, are seen. "Almost all" words here means almost all with respect to the measure $\mu_\beta$ under which the $\xi_i$ are i.i.d. with $\mu_\beta {\xi_i = 0}=1 - \mu_\beta {\xi_i = 1} = \beta$ (for an arbitrary $0 <\beta < 1$).

Article information

Source
Electron. J. Probab., Volume 3 (1998), paper no. 10, 75 pp.

Dates
Accepted: 7 July 1998
First available in Project Euclid: 29 January 2016

Permanent link to this document
https://projecteuclid.org/euclid.ejp/1454101770

Digital Object Identifier
doi:10.1214/EJP.v3-32

Mathematical Reviews number (MathSciNet)
MR1637089

Zentralblatt MATH identifier
0908.60082

Subjects
Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43]

Keywords
Percolation Triangular lattice

Rights
This work is licensed under aCreative Commons Attribution 3.0 License.

Citation

Kesten, Harry; Sidoravicius, Vladas; Zhang, Yu. Almost All Words Are Seen In Critical Site Percolation On The Triangular Lattice. Electron. J. Probab. 3 (1998), paper no. 10, 75 pp. doi:10.1214/EJP.v3-32. https://projecteuclid.org/euclid.ejp/1454101770


Export citation

References

  • Athreya, K. B. and Ney, P. E., (1972), Branching Processes, Springer-Verlag.
  • Benjamini, I. and Kesten, H., (1995), Percolation of arbitrary words in ${0,1}^{Bbb N}$, Ann. Probab., 23, 1024-1060.
  • van den Berg, J. and Fiebig, U., (1987), On a combinatorial conjecture concerning disjoint occurrences of events, Ann. Probab., 15, 354-374.
  • Chayes, J. T., Chayes, L. and Durrett, R., (1986), Critical behavior of the two-dimensional first passage time, J. Stat. Phys., 45, 933-951.
  • Fisher, M., (1961), Critical probabilities for cluster size and percolation problems, J. Math. Phys., 2, 620-627.
  • Grimmett, G., (1989), Percolation, Springer Verlag.
  • Harris, T. E., (1960), A lower bound for the critical probability in a certain percolation process, Proc. Cambr. Phil. Soc., 56, 13-20.
  • Kesten, H., (1980), The critical probability of bond percolation on the square lattice equals 1/2, Comm. Math. Phys., 74, 41-59.
  • Kesten, H., (1982), Percolation Theory for Mathematicians, Birkhäuser, Boston.
  • Kesten, H., (1987), Scaling relations for 2D-percolation, Comm. Math. Phys., 109, 109-156.
  • Kesten, H. and Zhang, Y., (1987), Strict inequalities for some critical exponents in two-dimensional percolation, J. Stat. Phys., 46, 1031-1055.
  • Kesten, H. and Zhang, Y., (1997), A central limit theorem for “critical” first-passage percolation in two dimensions, Prob. Theory Rel. Fields, 107 137-160.
  • Mai, T. and Halley, J. W., (1980), AB percolation on a triangular lattice, in Ordering in Two Dimensions, S. K. Sinha, ed., pp. 369-371, North-Holland.
  • Newman, M. H. A., (1951), Elements of the Topology of Plane Sets of Points, second ed., Cambridge U.P.
  • Reimer, D., (1996), Butterflies, preprint.
  • Wierman, J. C. and Appel, M. J., (1987), Infinite AB percolation clusters exist on the triangular lattice, J. Phys. A, 20, 2533-2537.