Metraipolis › archive › dc_7083ac7e7fa8

Recurrence and transience of random walks in monotonically changing environments — arXiv:2609.28848

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.28848
License (as archived)
CC0-1.0
Archived
2026-10-08T06:07:47.775Z
SHA-256 of the archived text
e14cb2c87de78a12b2a320d41b957e60ae5579303b2d603be59cd6358ff8f280
Stable URL of this page
https://metraipolis.com/documento/dc_7083ac7e7fa8

How to cite

Recurrence and transience of random walks in monotonically changing environments — arXiv:2609.28848 — arXiv (en), https://arxiv.org/abs/2609.28848 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7083ac7e7fa8 (Metraipolis archive dc_7083ac7e7fa8, sha256 e14cb2c87de78a12b2a320d41b957e60ae5579303b2d603be59cd6358ff8f280)
BibTeX
@misc{dc7083ac7e7fa8,
  title = {Recurrence and transience of random walks in monotonically changing environments — arXiv:2609.28848},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.28848},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7083ac7e7fa8; sha256 e14cb2c87de78a12b2a320d41b957e60ae5579303b2d603be59cd6358ff8f280},
  year = {2026}
}

Archived text

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

Let $(c_t)_{t\geq 0}$ be a deterministic family of edge conductances on a countable vertex set, monotone in $t$, and let $(X_t)$ be the random walk that takes its $t$-th step using the conductances $c_t$. We prove that if $c_t\uparrow c_\infty$ and $c_\infty$ is recurrent (respectively, $c_0$ is transient), then $(X_t)$ is almost surely recurrent (respectively, transient), i.e., visits every vertex infinitely (respectively, finitely) often. We also establish the analogous results in continuous time. This proves conjectures of Amir, Benjamini, Gurel-Gurevich, and Kozma, and the special case of $\{ 0, 1 \}$-valued conductances corresponds to simple random walk on a growing graph, and in this special case our results prove a conjecture of Dembo, Huang, and Sidoravicius. In addition, we provide counterexamples to the corresponding conjectures when $(c_t)$ is monotone non-increasing: if $c_t\downarrow c_\infty$ and $c_\infty$ is transient, $(X_t)$ need not be transient, and similarly if $c_0$ is recurrent, $(X_t)$ need not be recurrent, even if $c_\infty\geq\alpha c_0$ for some $\alpha>0$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.28848 — 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-08T05:35:05.128Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).