Percolation of words on the hypercubic lattice with one-dimensional long-range interactions
From MaRDI portal
Publication:2080271
Abstract: We investigate the problem of percolation of words in a random environment. To each vertex, we independently assign a letter or according to Bernoulli r.v.'s with parameter . The environment is the resulting graph obtained from an independent long-range bond percolation configuration on , , where each edge parallel to has length one and is open with probability , while edges of length parallel to are open with probability . We prove that if the sum of diverges, then for any and , there is a such that all words are seen from the origin with probability close to , even if all connections with length larger than are suppressed.
Recommendations
Cites work
- scientific article; zbMATH DE number 4185662 (Why is no real title available?)
- Almost all words are seen in critical site percolation on the triangular lattice
- An upper bound on the critical percolation probability for the three- dimensional cubic lattice
- Bernoulli percolation above threshold: An invasion percolation analysis
- Critical probabilities for site and bond percolation models
- Interacting particle systems. With a new postface.
- On the probability of occurence of labelled subtrees of a randomly labelled tree
- On the truncation of systems with non-summable interactions
- Percolation of Words on Zd with Long-Range Connections
- Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
- Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
- Stochastic domination: the contact process, Ising models and FKG measures
- The supercritical phase of percolation is well behaved
- Truncated long-range percolation on oriented graphs
Cited in
(4)
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)