Skip to content
DraconiticResearch
Search Sources API
197,693 studies31 sourcesUpdated 36 min ago
PreprintarXiv licencearXiv

Phase transitions for percolation of words in one dimension

Abstract

In this paper, we investigate models of percolation of words on ℤ+ with long-range connections. The underlying graph is oriented and constructed according to a sequence of non-negative ranges. In the first model, the sequence of ranges is considered random and, in the second model, deterministic and non-decreasing. In both cases, we establish a phase transition for the occurrence of percolation of all words simultaneously from the origin.

Related

  1. Continuity for random walks in hyperbolic percolation: drift, entropy, and dimension
    Kohki Sakamoto
    arXivPreprintarXiv licenceFull textAlgebra & number theoryDynamical systemsarXiv
  2. Markovian renormalisation for percolation in high-dimension: Semi-decidability of mean field behavior
    Arthur Blanc-Renaudie
    HALPreprintarXiv licenceFull textMathematical physicsProbabilityHALarXiv
  3. Graph distance and percolation dimension of three-dimensional Brownian motion
    Daisuke Shiraishi
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  4. Loop soup percolation and boundary dimension on metric trees
    Christian Mönch
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  5. Continuity of the phase transition for long-range Bernoulli percolation with exponential decay on ℤ2
    Omer Angel, Daniel de la Riva, Christoforos Panagiotis +1
    arXivPreprintarXiv licenceFull textProbabilityarXiv
BibTeX
@misc{carvalho2026phase,
  title = {{Phase transitions for percolation of words in one dimension}},
  author = {Gustavo O. de Carvalho and Pablo A. Gomes},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.05112},
  eprint = {2609.05112},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.05112},
}
RIS
TY  - UNPB
TI  - Phase transitions for percolation of words in one dimension
AU  - Gustavo O. de Carvalho
AU  - Pablo A. Gomes
PY  - 2026
DA  - 2026/09/04
PB  - arXiv
DO  - 10.48550/arxiv.2609.05112
UR  - https://arxiv.org/abs/2609.05112
AB  - In this paper, we investigate models of percolation of words on ℤ_+ with long-range connections. The underlying graph is oriented and constructed according to a sequence of non-negative ranges. In the first model, the sequence of ranges is considered random and, in the second model, deterministic and non-decreasing. In both cases, we establish a phase transition for the occurrence of percolation of all words simultaneously from the origin.
ER  -