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

DOI10.1016/J.SPA.2022.07.008zbMATH Open1503.60148arXiv2202.13190OpenAlexW4288760239MaRDI QIDQ2080271FDOQ2080271

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

Publication date: 7 October 2022

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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 $mathbb{Z}^{d-1}imesmathbbZ$, $dgeq3$, where each edge parallel to $mathbb{Z}^{d-1}$ has length one and is open with probability $epsilon$, while edges of length $n$ parallel to $mathbbZ$ are open with probability $p_n$. We prove that if the sum of $p_n$ diverges, then for any $epsilon$ 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.

Full work available at URL: https://arxiv.org/abs/2202.13190

Recommendations

• Percolation of Words on Z^d with Long-Range Connections
• Percolation of arbitrary words in one dimension
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
• On long range percolation with heavy tails

zbMATH Keywords

truncationlong-range percolationpercolation of words

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Percolation (82B43)

Cites Work

• Interacting particle systems. With a new postface.
• On the truncation of systems with non-summable interactions
• Truncated long-range percolation on oriented graphs
• The supercritical phase of percolation is well behaved
• On the probability of occurence of labelled subtrees of a randomly labelled tree
• Almost all words are seen in critical site percolation on the triangular lattice
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Percolation of Words on Z^d with Long-Range Connections
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
• Critical probabilities for site and bond percolation models
• Bernoulli percolation above threshold: An invasion percolation analysis
• Stochastic domination: the contact process, Ising models and FKG measures
• An upper bound on the critical percolation probability for the three- dimensional cubic lattice
• Title not available (Why is that?)

Cited In (4)

• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Percolation of arbitrary words in one dimension
• Percolation of Words on Z^d with Long-Range Connections

This page was built for publication: Percolation of words on the hypercubic lattice with one-dimensional long-range interactions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2080271)