Embedding of reversible Markov matrices
Ellen Baake, Michael Baake, Jeremy Sumner
TL;DR
This work analyzes the embeddability problem for reversible Markov matrices beyond irreducible cases, allowing weak reversibility and negative eigenvalues. It develops an algebraic framework using p-balanced pairs and reversibility, clarifies when a real matrix logarithm yields a Markov generator, and provides concrete, testable criteria for reversible embeddability based on the minimal polynomial and spectrum. The paper shows that, even with positive spectrum, embeddability can be unique, but degeneracies can yield multiple, sometimes non-commuting, reversible and non-reversible embeddings, illustrated with explicit constructions. It also outlines practical extensions to time-inhomogeneous Markov flows and contexts where reversible models serve as useful approximations or starting points for inference in applications such as phylogenetics.
Abstract
The embeddability of reversible Markov matrices into time-homogeneous Markov semigroups is revisited, with some focus on simplifications and extensions. In particular, we do not demand irreducibility and consider weakly reversible matrices as well as reversible matrices with negative eigenvalues.
