Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)

DOI10.1214/EJP.V6-77zbMath0977.60098MaRDI QIDQ5936785

Y. Zhang, Harry Kesten, Vladas Sidoravićius

Publication date: 1 August 2001

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121517

zbMATH Keywords

percolationclose-packing

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (9)

Lipschitz embeddings of random fields ⋮ Lipschitz embeddings of random sequences ⋮ No exceptional words for Bernoulli percolation ⋮ Dependent percolation on \(\mathbb{Z}^2\) ⋮ Percolation of arbitrary words in one dimension ⋮ Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\) ⋮ Percolation of Words on Z^d with Long-Range Connections ⋮ Percolation of words on the hypercubic lattice with one-dimensional long-range interactions ⋮ Oriented percolation in a random environment

This page was built for publication: Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)