Answers are grounded in this paper and cite their sources.
Within the set of discrete-time Markov chains, a Markov chain is embeddable in case its transition matrix has at least one root that is a stochastic matrix. The present paper examines the embedding problem for discrete-time Markov chains with three states and with real eigenvalues. Sufficient embedding conditions are proved for diagonalizable transition matrices as well as for non-diagonalizable transition matrices and for all possible configurations regarding the sign of the eigenvalues. The embedding conditions are formulated in terms of the projections and the spectral decomposition of the transition matrix.
No takes yet. Share an insight, caveat, or question.
Marie‐Anne Guerry (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: