Percolation of arbitrary words in one dimension

DOI10.1002/RSA.20312MaRDI QIDQ3057069zbMATH OpenOpenAlexFDO

Authors G. R. Grimmett, Thomas M. Liggett, Thomas Richthammer

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)

Abstract: We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation model. The main issue is whether a given infinite binary word appears within an iid Bernoulli sequence at locations that satisfy certain constraints. We settle the issue in some cases, and provide partial results in others.

Recommendations

• Percolation of Words on Z^d with Long-Range Connections
• Percolation of words on the hypercubic lattice with one-dimensional long-range interactions
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Almost all words are seen in critical site percolation on the triangular lattice
• A note about the truncation question in percolation of words

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
• scientific article; zbMATH DE number 1416163 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)

Cited in

(12)

• A note about the truncation question in percolation of words
• Lipschitz embeddings of random fields
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Percolation of words on the hypercubic lattice with one-dimensional long-range interactions
• Percolation of Words on Z^d with Long-Range Connections
• Scheduling of non-colliding random walks
• Clairvoyant embedding in one dimension
• Lipschitz embeddings of random sequences
• On the Compatibility of Binary Sequences
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
• No exceptional words for Bernoulli percolation
• Lattice embeddings in percolation

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

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