Metraipolis › archive › dc_71eb976a5f2a

Cutoff for Simple Random Walk on Preferential Attachment Graphs — arXiv:2611.00717

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00717
License (as archived)
CC0-1.0
Archived
2026-11-03T11:34:17.623Z
SHA-256 of the archived text
7f4b7c80ab04966918d8a6dcbf78b58ff79f8f092d41c2739fe4229188b409e8
Stable URL of this page
https://metraipolis.com/documento/dc_71eb976a5f2a

How to cite

Cutoff for Simple Random Walk on Preferential Attachment Graphs — arXiv:2611.00717 — arXiv (en), https://arxiv.org/abs/2611.00717 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_71eb976a5f2a (Metraipolis archive dc_71eb976a5f2a, sha256 7f4b7c80ab04966918d8a6dcbf78b58ff79f8f092d41c2739fe4229188b409e8)
BibTeX
@misc{dc71eb976a5f2a,
  title = {Cutoff for Simple Random Walk on Preferential Attachment Graphs — arXiv:2611.00717},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00717},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_71eb976a5f2a; sha256 7f4b7c80ab04966918d8a6dcbf78b58ff79f8f092d41c2739fe4229188b409e8},
  year = {2026}
}

Archived text

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

We consider simple random walk on the sequential affine preferential attachment graphs with fixed parameters $m\ge2$ and $\delta\ge0$. We prove the walk has total-variation cutoff, and for every fixed $\varepsilon\in(0,1)$, \[ t_{\mathrm{mix}}^{(n)}(\varepsilon) =\frac{\log n}{\nu d} +O_{\mathbb P}\!\left(\sqrt{\log n}\right), \] where $\nu>0$ is the walk speed and $d>0$ is the entropy per level of harmonic measure on the Pólya--point tree, the local weak limit of the graph. Thus cutoff occurs at the entropic time. Entropic cutoff was previously established for a range of random graph models including configuration models under mild degree assumptions and on Erdős--Rényi random graphs for typical starting points. We extend the harmonic-measure approach to preferential attachment, accounting for its age-dependent structure and hubs of polynomial degree. The local weak limit, the Pólya--point tree, provides a more tractable setting for analyzing the walk. The proof combines regeneration estimates on the local limit tree, a quantitative graph--tree coupling on the mixing-time scale, and control of hub excursions. We show that shortly before the cutoff time its distribution is close in total variation distance to a measure with small $L^\infty$ distance from stationarity. When $m\ge2$, the spectral gap is bounded away from zero with high probability which completes the upper-bound coupling argument.

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.00717 — 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-03T11:04:52.221Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).