Percolation of arbitrary words in one dimension

Random Structures and Algorithms

Volumn 37, Issue 1, 2010, Pages 85-99

  Grimmett, Geoffrey R ^a   Liggett, Thomas M ^b   Richthammer, Thomas ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Long range percolation; Percolation of words

Indexed keywords

EID: 77954482985     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20312     Document Type: Article

References (9)

1. P. N. Balister, B. Bollobás, and A. M. Stacey, Dependent percolation in two dimensions, Probab Theor Relat Fields 117 (2000), 495-513.
2. N, Ann Probab 23 (1995), 1024-1060.
3. W. Feller, An introduction to probability theory and its applications, 3rd edition, Vol. I, Wiley, New York, 1968.
4. W. Feller, An introduction to probability theory and its applications, Vol. II, Wiley, New York, 1966.
5. G. R. Grimmett, Three problems for the clairvoyant demon, In N. H. Bingham and C. M. Goldie, editors,ProbabilityandMathematicalGenetics,CambridgeUniversityPress,2010,pp.379-395.
6. H. Kesten, V. Sidoravicius, and Y. Zhang, Almost all words are seen in critical site percolation on the triangular lattice, Electron J Probab 3 (1998), Paper 10, 1-75.
7. 2, Electron J Probab 6 (2001), Paper 4, 1-27.
8. B. N. B. de Lima, A note about the truncation question in percolation of words, Bull Braz Math Soc New Ser 39 (2008), 183-189.
9. P. Winkler, Dependent percolation and colliding random walks, Random Struct Algor 16 (2000), 58-84.