2000 character limit reached
On equal-input and monotone Markov matrices
Published 22 Jul 2020 in math.PR | (2007.11433v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.