Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)

DOI10.1214/aop/1176988173zbMath0832.60095OpenAlexW2006331145MaRDI QIDQ1902940

Harry Kesten, Itai Benjamini

Publication date: 20 February 1996

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176988173

zbMATH Keywords

wordspercolationgraphstreesoriented percolation

Mathematics Subject Classification ID

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

Related Items (14)

Lipschitz embeddings of random fields ⋮ Lipschitz embeddings of random sequences ⋮ No exceptional words for Bernoulli percolation ⋮ Dependent percolation on \(\mathbb{Z}^2\) ⋮ Number of complete \(N\)-ary subtrees on Galton-Watson family trees ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 ⋮ On the Compatibility of Binary Sequences ⋮ Percolation of arbitrary words in one dimension ⋮ Branching random walk with exponentially decreasing steps, and stochastically self-similar measures ⋮ Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\) ⋮ Invariant 𝜌-percolation on regular trees ⋮ 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 in \(\{0, 1\}^ \mathbb{N}\)