Percolation of arbitrary words in one dimension
classification
🧮 math.PR
keywords
percolationissueotherswordsappearanceappearsarbitrarybernoulli
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.