Metraipolis › archive › dc_396d43090680

Metastability of interacting stochastic systems with countably many metastable states: beyond positive recurrence — arXiv:2609.02331

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.02331
License (as archived)
CC0-1.0
Archived
2026-10-17T05:26:25.141Z
SHA-256 of the archived text
92cce3fe9ce9c095764dd90c9693d0f99384f7606d69f04524f8d00218fbdef5
Stable URL of this page
https://metraipolis.com/documento/dc_396d43090680

How to cite

Metastability of interacting stochastic systems with countably many metastable states: beyond positive recurrence — arXiv:2609.02331 — arXiv (en), https://arxiv.org/abs/2609.02331 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_396d43090680 (Metraipolis archive dc_396d43090680, sha256 92cce3fe9ce9c095764dd90c9693d0f99384f7606d69f04524f8d00218fbdef5)
BibTeX
@misc{dc396d43090680,
  title = {Metastability of interacting stochastic systems with countably many metastable states: beyond positive recurrence — arXiv:2609.02331},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.02331},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_396d43090680; sha256 92cce3fe9ce9c095764dd90c9693d0f99384f7606d69f04524f8d00218fbdef5},
  year = {2026}
}

Archived text

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

Metastability is typically formulated for systems with finitely many metastable states, most often in positively recurrent settings. In this article, we extend the resolvent framework for metastability to Markov processes with countably many metastable states, thereby encompassing null-recurrent and transient dynamics. For a family of processes on locally compact Polish spaces, we prove, under a mild boundary regularity assumption, that the asymptotic flatness of microscopic resolvent solutions, supplemented by two compactness conditions, is equivalent to convergence in law of the projected trace processes to a limiting Markov chain and to the negligibility of the time spent outside the metastable sets. We apply this framework to two non-compact stochastic systems. First, we study a condensing inclusion process on a countably infinite, uniformly locally finite graph, in a setting where the process may be null recurrent or transient. We prove that the condensate location converges to a weighted random walk on the underlying graph, while the time spent away from the fully condensed configurations is negligible. Second, we study a small-noise one-dimensional Langevin diffusion with countably many stable equilibria, without assuming ergodicity. In the Eyring-Kramers time scale associated with the minimal energy barrier, we establish local equilibration inside each well, convergence of the well-index process to an explicit nearest-neighbor Markov chain on $\mathbb Z$, and negligibility of inter-well excursions. Together, these results broaden the scope of resolvent-based metastability theory beyond finite metastable state spaces and positive recurrence.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.PR).
Categorie arXiv: Probability (math.PR) ; Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.02331 — 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-17T04:44:48.582Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).