English

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

Probability 2015-12-22 v1

Abstract

Consider a sequence (ηN(t):t0)(\eta^N(t) :t\ge 0) of continuous-time, irreducible Markov chains evolving on a fixed finite set EE, indexed by a parameter NN. Denote by RN(η,ξ)R_N(\eta,\xi) the jump rates of the Markov chain ηtN\eta^N_t, and assume that for any pair of bonds (η,ξ)(\eta,\xi), (η,ξ)(\eta',\xi') arctan{RN(η,ξ)/RN(η,ξ)}\arctan \{R_N(\eta,\xi)/R_N(\eta',\xi')\} converges as NN\uparrow\infty. Under a hypothesis slightly more restrictive (cf. \eqref{mhyp} below), we present a recursive procedure which provides a sequence of increasing time-scales θN1,,θN\mfp\theta^1_N, \dots, \theta^{\mf p}_N, θNjθNj+1\theta^j_N \ll \theta^{j+1}_N, and of coarsening partitions {\msE1j,,\msE\mfnjj,Δj}\{\ms E^j_1, \dots, \ms E^j_{\mf n_j}, \Delta^j\}, 1j\mfp1\le j\le \mf p, of the set EE. Let ϕj:E{0,1,,\mfnj}\phi_j: E \to \{0,1, \dots, \mf n_j\} be the projection defined by ϕj(η)=x=1\mfnjx\mb1{η\msExj} \phi_j(\eta) = \sum_{x=1}^{\mf n_j} x \, \mb 1\{\eta \in \ms E^j_x\}. For each 1j\mfp1\le j\le \mf p, we prove that the hidden Markov chain XNj(t)=ϕj(ηN(tθNj))X^j_N(t) = \phi_j(\eta^N(t\theta^j_N)) converges to a Markov chain on {1,,\mfnj}\{1, \dots, \mf n_j\}.

Keywords

Cite

@article{arxiv.1512.06597,
  title  = {Metastability of finite state Markov chains: a recursive procedure to identify slow variables for model reduction},
  author = {C. Landim and T. Xu},
  journal= {arXiv preprint arXiv:1512.06597},
  year   = {2015}
}