English

Coarse-graining and reconstruction for Markov matrices

Probability 2021-10-20 v1 Combinatorics Functional Analysis

Abstract

We present a coarse-graining (or model order reduction) procedure for stochastic matrices by clustering. The method is consistent with the natural structure of Markov theory, preserving positivity and mass, and does not rely on any tools from Hilbert space theory. The reconstruction is provided by a generalized Penrose-Moore inverse of the coarse-graining operator incorporating the inhomogeneous invariant measure of the Markov matrix. As we show, the method provides coarse-graining and reconstruction also on the level of tensor spaces, which is consistent with the notion of an incidence matrix and quotient graphs, and, moreover, allows to coarse-grain and reconstruct fluxes. Furthermore, we investigate the connection with functional inequalities and Poincar\'e-type constants.

Cite

@article{arxiv.2110.09631,
  title  = {Coarse-graining and reconstruction for Markov matrices},
  author = {Artur Stephan},
  journal= {arXiv preprint arXiv:2110.09631},
  year   = {2021}
}

Comments

17 pages

R2 v1 2026-06-24T06:59:30.914Z