Metraipolis › archive › dc_1d08decf2b82

Phase Transition and Fluctuation Results for First-Passage Percolation on Spread-Out Cycle Graphs — arXiv:2609.00110

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.00110
License (as archived)
CC0-1.0
Archived
2026-10-17T07:05:54.661Z
SHA-256 of the archived text
c9246d4fb8daccc81edfcb6e99040d553f27a3ed86fd94b33ba2006010d645f6
Stable URL of this page
https://metraipolis.com/documento/dc_1d08decf2b82

How to cite

Phase Transition and Fluctuation Results for First-Passage Percolation on Spread-Out Cycle Graphs — arXiv:2609.00110 — arXiv (en), https://arxiv.org/abs/2609.00110 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1d08decf2b82 (Metraipolis archive dc_1d08decf2b82, sha256 c9246d4fb8daccc81edfcb6e99040d553f27a3ed86fd94b33ba2006010d645f6)
BibTeX
@misc{dc1d08decf2b82,
  title = {Phase Transition and Fluctuation Results for First-Passage Percolation on Spread-Out Cycle Graphs — arXiv:2609.00110},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.00110},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1d08decf2b82; sha256 c9246d4fb8daccc81edfcb6e99040d553f27a3ed86fd94b33ba2006010d645f6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.00110. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study first-passage percolation on the $\ell$-spread-out one-dimensional cycle of size $n$, where vertices are connected if their graph distance is at most $\ell$. We assign i.i.d.~non-negative random weights from a Weibull distribution $\omega_e \sim \mathrm{Exp}(1)^{1/\theta}$ to the edges for $\theta>0$ fixed. This paper investigates the transition in the asymptotic behavior of the passage time $T_n$ between two typical vertices and the hop-count of the optimal path as the connectivity parameter $\ell$ diverges with $n$. We identify two fundamentally distinct geometric regimes. In the mesoscopic regime ($1 \ll \ell \ll n$), the optimal path locally mimics a spatial branching random walk but remains globally constrained to a one-dimensional geometry. We establish a law of large numbers characterized by the front speed of a Crump--Mode--Jagers branching random walk, prove a central limit theorem with Gaussian fluctuations when $\ell\ll n^{1/4}$, and show that the expected hop-count grows proportionally with the spatial distance. In the macroscopic regime ($\ell \approx \lambda n$ for $\lambda \in (0,1/2)$), the graph becomes a highly connected mean-field network. We prove that the passage time collapses to a $\log n$ scale with constant order non-Gaussian fluctuations, explicitly determining the extreme-value limit driven by the collision of two independent non-spatial CMJ processes. We establish a law of large numbers for the hop-count. Finally, we rigorously trace the transition in the order of the mean of $T_n$ between these two regimes, demonstrating an order transition for the passage time across the critical connectivity threshold $\ell \asymp n/\log n$. Our results provide a comprehensive deterministic-range interpolation from spatial Gaussian fluctuations to mean-field extreme-value fluctuations.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.00110 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T06:52:29.057Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).