paper

Metastability of finite state Markov chains: a recursive procedure to identify slow variables for model reduction

arXiv:1512.06597

Abstract

Consider a sequence of continuous-time, irreducible Markov chains evolving on a fixed finite set , indexed by a parameter . Denote by the jump rates of the Markov chain , and assume that for any pair of bonds , converges as . Under a hypothesis slightly more restrictive (cf. \eqref{mhyp} below), we present a recursive procedure which provides a sequence of increasing time-scales $θ^1_N, \dots, θ^{\mf p}_N$, , and of coarsening partitions $\{\ms E^j_1, \dots, \ms E^j_{\mf n_j}, Δ^j\}$, $1\le j\le \mf p$, of the set . Let $ϕ_j: E \to \{0,1, \dots, \mf n_j\}$ be the projection defined by $ ϕ_j(η) = \sum_{x=1}^{\mf n_j} x \, \mb 1\{η\in \ms E^j_x\}$. For each $1\le j\le \mf p$, we prove that the hidden Markov chain converges to a Markov chain on $\{1, \dots, \mf n_j\}$.

Metastability of finite state Markov chains: a recursive procedure to identify slow variables for model reduction · wovepaper