Embedding binary sequences into Bernoulli site percolation on Z^3

DOI10.1016/J.SPA.2014.07.022MaRDI QIDQ744240zbMATH OpenOpenAlexFDO

Authors Pierre Nolin, Marcelo Richard Hilário, Bernardo Nunes Borges de Lima, Vladas Sidoravicius

Publication date 6 October 2014

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.5262

zbMATH Keywords

Bernoulli percolationblock renormalizationpercolation of words

Mathematics Subject Classification ID

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

Abstract: We investigate the problem of embedding infinite binary sequences into Bernoulli site percolation on $mathbb{Z}^d$ with parameter $p$, known also as percolation of words. In 1995, I. Benjamini and H. Kesten proved that, for $dgeq10$ and $p=1/2$, all sequences can be embedded, almost surely. They conjectured that the same should hold for $dgeq3$. In this paper we consider $dgeq3$ and $pin(p_c(d),1-p_c(d))$, where $p_c(d)<1/2$ is the critical threshold for site percolation on $mathbb{Z}^d$. We show that there exists an integer $M=M(p)$, such that, a.s., every binary sequence, for which every run of consecutive {0s} or {1s} contains at least $M$ digits, can be embedded.

Review text

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.

Recommendations

• No exceptional words for Bernoulli percolation
• Almost all words are seen in critical site percolation on the triangular lattice
• A note about the truncation question in percolation of words
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
• Percolation of Words on Z^d with Long-Range Connections
• The travel time in a finite box in supercritical Bernoulli percolation
• Critical point and percolation probability in a long range site percolation model on \(\mathbb Z^d\)
• Non-coexistence of infinite clusters in two-dimensional dependent site percolation
• Percolation on Penrose Tilings

Cites work

• A note about the truncation question in percolation of words
• Almost all words are seen in critical site percolation on the triangular lattice
• An upper bound on the critical percolation probability for the three- dimensional cubic lattice
• Domination by product measures
• scientific article; zbMATH DE number 4185662 (Why is no real title available?)
• Large deviations for discrete and continuous percolation
• Lipschitz embeddings of random sequences
• On the Compatibility of Binary Sequences
• On the probability of occurence of labelled subtrees of a randomly labelled tree
• Percolation in half-spaces: Equality of critical densities and continuity of the percolation probability
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
• The critical probability for random Voronoi percolation in the plane is 1/2

Cited in

(5)

• Lipschitz embeddings of random fields
• Stochastic domination and comb percolation
• Clairvoyant embedding in one dimension
• No exceptional words for Bernoulli percolation
• Face and cycle percolation

This page was built for publication: Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744240)