2000 character limit reached
Embeddable Markov Matrices
Published 11 Jan 2010 in math.PR, math.SP, math.ST, and stat.TH | (1001.1693v1)
Abstract: We give an account of some results, both old and new, about any $n\times n$ Markov matrix that is embeddable in a one-parameter Markov semigroup. These include the fact that its eigenvalues must lie in a certain region in the unit ball. We prove that a well-known procedure for approximating a non-embeddable Markov matrix by an embeddable one is optimal in a certain sense.
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.