Metraipolis › archive › dc_7e131bb0dba0
Random Walk on age-preferential random growth processes — arXiv:2611.02329
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02329
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:47:29.914Z
- SHA-256 of the archived text
07363cafce0811ddf0dd91e2346f6369140f0d05a0708476f0ea892603161525- Stable URL of this page
https://metraipolis.com/documento/dc_7e131bb0dba0
How to cite
Random Walk on age-preferential random growth processes — arXiv:2611.02329 — arXiv (en), https://arxiv.org/abs/2611.02329 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7e131bb0dba0 (Metraipolis archive dc_7e131bb0dba0, sha256 07363cafce0811ddf0dd91e2346f6369140f0d05a0708476f0ea892603161525)
BibTeX
@misc{dc7e131bb0dba0,
title = {Random Walk on age-preferential random growth processes — arXiv:2611.02329},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02329},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7e131bb0dba0; sha256 07363cafce0811ddf0dd91e2346f6369140f0d05a0708476f0ea892603161525},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02329. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper studies a class of \textbf{exponentially age-preferential random growth graphs} $G(m,\beta)$: at each time $n$ a new vertex $v_n$ is added, and $m$ edges are drawn to existing vertices independently, with the probability that a target $v_k$ is chosen proportional to $e^{\beta k}$ ($\beta>0$), so that the graph's growth strongly favors ``young'' vertices. We systematically investigate two fundamental probabilistic problems of this model and supply the proof details: (1)~\textbf{Recurrence}: when $\beta>0$, the simple random walk on $G$ is recurrent with probability $1$ (Theorem~\ref{thm:rec}); (2)~\textbf{Infinite collisions}: for every $\beta>0$, two independent simple random walks on $G$ meet infinitely often with probability $1$ (Theorem~\ref{thm:icp}). The core of the proof is the following: by the Borel--Cantelli lemma combined with the \textbf{memoryless property} of exponential weights, $G$ is almost surely ``sausage-like'' --- there exist infinitely many bottlenecks consisting of exactly $m$ parallel edges; the cascade of bottlenecks makes the effective resistance diverge, yielding recurrence; the renewal process $\{T_k\}$ constructed at the bottleneck times has i.i.d.\ stationary increments with finite moments of every order for the first-passage times, and combined with a moderate-deviation estimate we verify Peres' Green-function criterion for infinite collisions.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.02329 — 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-11-03T18:15:07.725Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).