Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\) (Q744240)

Consider the nearest neighbor lattice \(\mathbb Z^d\) with dimension \(d\geq 3\). Assign labels \(0\) or \(1\) to each of its vertices independently, \(1\) with probability \(p\), and \(0\) with probability \(1-p\). Given a configuration of labels, every infinite nearest neighbor vertex self-avoiding path in \(\mathbb Z^d\) defines an infinite sequence of \(0\)'s and \(1\)'s, the labels of its vertices. Such sequences are called embedded in the configuration. \textit{I. Benjamini} and \textit{H. Kesten} [Ann. Probab. 23, No. 3, 1024--1060 (1995; Zbl 0832.60095)] proved that, for \(d\geq 10\) and \(p=\frac 12\), all infinite sequences of \(0\)'s and \(1\)'s are embedded in almost all configurations. The authors of the present paper prove that, for all \(d\geq 3\) and \(p\in(p_c(d),1-p_c(d))\), where \(p_c(d)<\frac 12\) is the critical threshold for site percolation on \(\mathbb Z^d\), there exists \(M=M(p)\) such that all infinite sequences of \(0\)'s and \(1\)'s for which every run of consecutive \(0\)'s or \(1\)'s has length at least \(M\) are embedded in almost all configurations.