Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A note about the truncation question in percolation of words

A note about the truncation question in percolation of words Consider an independent site percolation model on ℤ2, with parameter p, equipped with all horizontal and vertical connections. In this note it is shown that given for any parameter p ∈ (0, 1), there exists an integer N such that any binary sequence (word) ξ ∈ {0, 1}ℕ is seen, almost surely, even if all connections whose length is bigger than N are suppressed. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Bulletin of the Brazilian Mathematical Society, New Series Springer Journals

A note about the truncation question in percolation of words

Download PDF
7 pages

Loading next page...
 
/lp/springer-journals/a-note-about-the-truncation-question-in-percolation-of-words-Eibnp0bX7M

References (4)

Publisher
Springer Journals
Copyright
Copyright © 2008 by Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Mathematics, general; Mathematical and Computational Physics
ISSN
1678-7544
eISSN
1678-7714
DOI
10.1007/s00574-008-0079-0
Publisher site
See Article on Publisher Site

Abstract

Consider an independent site percolation model on ℤ2, with parameter p, equipped with all horizontal and vertical connections. In this note it is shown that given for any parameter p ∈ (0, 1), there exists an integer N such that any binary sequence (word) ξ ∈ {0, 1}ℕ is seen, almost surely, even if all connections whose length is bigger than N are suppressed.

Journal

Bulletin of the Brazilian Mathematical Society, New Series – Springer Journals

Published: Jan 1, 2008

There are no references for this article.