On equal-input and monotone Markov matrices

Abstract

The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding problem are obtained in the process. To achieve our results, we need to employ various algebraic and geometric tools, including commutativity, permutation invariance and convexity. Of particular relevance in several demarcation results are Markov matrices that are idempotents.

33 pages; final version with various small adjustments

Cited by in corpus (2)

• Embedding of Markov matrices for $d⩽4$
• A multiple coupon collection process and its Markov embedding structure