Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\)
From MaRDI portal
Publication:744240
DOI10.1016/j.spa.2014.07.022zbMath1302.60135arXiv1310.5262MaRDI QIDQ744240
Pierre Nolin, Marcelo Richard Hilário, Vladas Sidoravićius, Bernardo Nunes Borges de Lima
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
60K35: Interacting random processes; statistical mechanics type models; percolation theory
82B43: Percolation
Related Items
Cites Work
- Unnamed Item
- Lipschitz embeddings of random sequences
- Percolation in half-spaces: Equality of critical densities and continuity of the percolation probability
- On the probability of occurence of labelled subtrees of a randomly labelled tree
- A note about the truncation question in percolation of words
- An upper bound on the critical percolation probability for the three- dimensional cubic lattice
- Almost all words are seen in critical site percolation on the triangular lattice
- Domination by product measures
- Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
- The critical probability for random Voronoi percolation in the plane is 1/2
- Large deviations for discrete and continuous percolation
- On the Compatibility of Binary Sequences
- Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)