< Back to previous page

Publication

Necessary embedding conditions for state-wise monotone Markov chains.

Journal Contribution - Journal Article

In previous work, the embedding problem is examined within the entire set of discrete-time Markov chains. However, for several phenomena, the states of a Markov model are ordered categories and the transition matrix is state-wise monotone. The present paper investigates the embedding problem for the specific subset of state-wise monotone Markov chains. We prove necessary conditions on the transition matrix of a discrete-time Markov chain with ordered states to be embeddable in a state-wise monotone Markov chain regarding time-intervals with length 0.5: A transition matrix with a square root within the set of state-wise monotone matrices has a trace at least equal to 1.

Journal: Linear & Multilinear Algebra
ISSN: 0308-1087
Issue: 8
Volume: 65
Pages: 1529-1539
Publication year:2017
Keywords:Embedding problem, Markov chain, Matrix root
CSS-citation score:1
Authors:International
Accessibility:Open