Percolation of arbitrary words in one dimension
| dc.creator | Grimmett, Geoffrey R. | |
| dc.creator | Liggett, Thomas M. | |
| dc.creator | Richthammer, Thomas | |
| dc.date | 2008-07-10 | |
| dc.date.accessioned | 2026-07-07T09:49:37Z | |
| dc.date.available | 2026-07-07T09:49:37Z | |
| dc.description | 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. | |
| dc.description | 16 pages | |
| dc.identifier | https://arxiv.org/abs/0807.1676 | |
| dc.identifier | http://arxiv.org/abs/0807.1676 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/164654 | |
| dc.subject | Probability | |
| dc.subject | 60K35 | |
| dc.title | Percolation of arbitrary words in one dimension | |
| dc.type | text |