On equal-input and monotone Markov matrices

From MaRDI portal
Revision as of 12:32, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5084792

DOI10.1017/APR.2021.39zbMATH Open1492.60215arXiv2007.11433OpenAlexW3045322534WikidataQ114119644 ScholiaQ114119644MaRDI QIDQ5084792FDOQ5084792

Jeremy G. Sumner, Michael Baake

Publication date: 28 June 2022

Published in: Advances in Applied Probability (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2007.11433





Cites Work


Cited In (3)

Uses Software






This page was built for publication: On equal-input and monotone Markov matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084792)