Percolation of arbitrary words in one dimension

DOI10.1002/rsa.20312zbMath1202.60155arXiv0807.1676OpenAlexW3083563875MaRDI QIDQ3057069

Geoffrey R. Grimmett, Thomas Richthammer, Thomas M. Liggett

Publication date: 24 November 2010

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

long-range percolationpercolation of words

Mathematics Subject Classification ID

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

Related Items (7)

Lipschitz embeddings of random fields ⋮ Clairvoyant embedding in one dimension ⋮ Lipschitz embeddings of random sequences ⋮ Lattice embeddings in percolation ⋮ Scheduling of Non-Colliding Random Walks ⋮ On the Compatibility of Binary Sequences ⋮ Percolation of Words on Z^d with Long-Range Connections

Cites Work

• Unnamed Item
• Unnamed Item
• A note about the truncation question in percolation of words
• Almost all words are seen in critical site percolation on the triangular lattice
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)

This page was built for publication: Percolation of arbitrary words in one dimension