Percolation of Words on Zd with Long-Range Connections

DOI10.1239/JAP/1324046024MaRDI QIDQ3108481zbMATH OpenOpenAlexFDO

Authors Rémy Sanchis, Roger W. C. Silva, Bernardo Nunes Borges de Lima

Publication date 4 January 2012

Published in Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

percolation of wordstruncation question

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)

Abstract: Consider an independent site percolation model on $$, with parameter $pin(0,1)$, where all long range connections in the axes directions are allowed. In this work we show that given any parameter $p$, there exists and integer $K(p)$ such that all binary sequences (words) $xiin{0,1}^N$ can be seen simultaneously, almost surely, even if all connections whose length is bigger than $K(p)$ are suppressed. We also show some results concerning the question how $K(p)$ should scale with $p$ when $p$ goes to zero. Related results are also obtained for the question of whether or not almost all words are seen.

Recommendations

• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Percolation of words on the hypercubic lattice with one-dimensional long-range interactions
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
• On the Truncated Long-Range Percolation on Z²
• Fully-connected bond percolation on \(\mathbb{Z}^d\)
• Percolation of arbitrary words in one dimension
• Decay properties of the connectivity for mixed long range percolation models on \(\mathbb Z^{d}\)
• Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers

Cites work

• scientific article; zbMATH DE number 1416163 (Why is no real title available?)
• scientific article; zbMATH DE number 4197122 (Why is no real title available?)
• A note about the truncation question in percolation of words
• Almost all words are seen in critical site percolation on the triangular lattice
• Collisions Among Random Walks on a Graph
• Metastability effects in bootstrap percolation
• On rough isometries of Poisson processes on the line
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Percolation of arbitrary words in one dimension
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
• The supercritical phase of percolation is well behaved
• Three problems for the clairvoyant demon

Cited in

(8)

• Percolation of words on the hypercubic lattice with one-dimensional long-range interactions
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
• A note about the truncation question in percolation of words
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Lipschitz embeddings of random sequences
• Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\)
• Percolation of arbitrary words in one dimension
• A percolation system with extremely long range connections and node dilution

This page was built for publication: Percolation of Words on Z^d with Long-Range Connections

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