Reducing metastable continuous-space Markov chains to Markov chains on a finite set

Nils Berglund
Annales de l'Institut Henri Poincaré Probab. Statist. 61:2036-2073 (2025)

We consider continuous-space, discrete-time Markov chains on R^d, that admit a finite number N of metastable states. Our main motivation for investigating these processes is to analyse random Poincaré maps, which describe random perturbations of ordinary differential equations admitting several periodic orbits. We show that under a few general assumptions, which hold in many examples of interest, the kernels of these Markov chains admit N eigenvalues exponentially close to 1, which are separated from the remainder of the spectrum by a spectral gap that can be quantified. Our main result states that these Markov chains can be approximated, uniformly in time, by a finite Markov chain with N states. The transition probabilities of the finite chain are exponentially close to first-passage probabilities at neighbourhoods of metastable states, when starting in suitable quasistationary distributions.

Mathematical Subject Classification: 60J05, 37H05 (primary), 60J35, 34F05 (secondary).

Keywords and phrases: Random Poincaré map, metastability, quasistationary distributions, trace process, large deviations.

 

Journal Homepage Published article: 10.1214/24-AIHP1468 MR4947161 Zbl8098598

PDF file (328 Kb) hal-04042150 arXiv/2303.12624