Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 4 min ago
PreprintarXiv licencearXiv

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

Abstract

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 ℤ, 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.

Related

  1. Metastability and Sharp Propagation-of-Chaos Thresholds for Mean-Field Interacting Diffusions on the Circle
    Sayan Banerjee
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  2. Ergodic and Metastable Behavior of Stochastic Popularity Dynamics in Social Networks
    Chiara Ravazzi, Paolo Frasca, Gaya Cocca
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Interacting Stochastic Systems with Agent-Based Sampling and Connection-Based Reinforcement
    Yogesh Dahiya, Gursharn Kaur, Neeraja Sahasrabudhe
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  4. Lie groups are countably representable
    Nicolas Monod, Andreas Thom
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. The group class SJ is not countably recognizable
    M. Brescia, B. G. Di Siena, E. Ingrosso +1
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryarXiv
BibTeX
@misc{kim2026metastability,
  title = {{Metastability of interacting stochastic systems with countably many metastable states: beyond positive recurrence}},
  author = {Seonwoo Kim and Jungkyoung Lee},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.02331},
  eprint = {2609.02331},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.02331},
}
RIS
TY  - UNPB
TI  - Metastability of interacting stochastic systems with countably many metastable states: beyond positive recurrence
AU  - Seonwoo Kim
AU  - Jungkyoung Lee
PY  - 2026
DA  - 2026/09/02
PB  - arXiv
DO  - 10.48550/arxiv.2609.02331
UR  - https://arxiv.org/abs/2609.02331
AB  - 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 ℤ, 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.
ER  -