Percolation of words on the hypercubic lattice with one-dimensional long-range interactions

Pablo A. Gomes, Otávio Lima and Roger W.C. Silva

Stochastic Processes and their Applications, 2022, vol. 153, issue C, 79-90

Abstract: We investigate the problem of percolation of words in a random environment. To each vertex, we independently assign a letter 0 or 1 according to Bernoulli r.v.’s with parameter p. The environment is the resulting graph obtained from an independent long-range bond percolation configuration on Zd−1×Z, d⩾3, where each edge parallel to Zd−1 has length one and is open with probability ϵ, while edges of length n parallel to Z are open with probability pn. We prove that if the sum of pn diverges, then for any ϵ and p, there is a K such that all words are seen from the origin with probability close to 1, even if all connections with length larger than K are suppressed.

Keywords: Percolation of words; Long-range percolation; Truncation (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304414922001739
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:153:y:2022:i:c:p:79-90

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spa.2022.07.008

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().