We prove that the probability substitution matrices obtained from a continuous-time Markov chain form a multiplicatively closed set if and only if the rate matrices associated with the chain form a linear space spanning a Lie algebra. The key original contribution we make is to overcome an obstruction, due to the presence of inequalities that are unavoidable in the probabilistic application, which prevents free manipulation of terms in the Baker–Campbell–Haursdorff formula
Notions of specification, implementation, satisfaction, and refinement, together with operators supp...
The attached file may be somewhat different from the published versionInternational audienceIn this ...
AbstractMarkov chains are widely used to determine system performance and reliability characteristic...
We prove that the probability substitution matrices obtained from a continuous-time Markov chain for...
We prove that the probability substitution matrices obtained from a continuous-time Markov chain for...
A matrix Lie algebra is a linear space of matrices closed under the operation [A, B] = AB − BA. The ...
We present and explore a general method for deriving a Lie-Markov model from a finite semigroup. If ...
Recent work has discussed the importance of multiplicative closure for the Markov models used in phy...
Recent work has discussed the importance of multiplicative closure for the Markov mod- els used in ...
Continuous-time Markov chains are a standard tool in phylogenetic inference. If homogeneity is assum...
Various analyses of the Lie Markov models: Fourier-Motzkin elimination, nesting, equilibrium base fr...
Abstract. The standard theorem for stochastic matrices with positive entries is generalized to matri...
AbstractNotions of specification, implementation, satisfaction, and refinement, together with operat...
From the datum of an integer partition and a classical Lie algebra, one can define a Markov chain on...
International audienceNotions of specification, implementation, satisfaction, and refinement, togeth...
Notions of specification, implementation, satisfaction, and refinement, together with operators supp...
The attached file may be somewhat different from the published versionInternational audienceIn this ...
AbstractMarkov chains are widely used to determine system performance and reliability characteristic...
We prove that the probability substitution matrices obtained from a continuous-time Markov chain for...
We prove that the probability substitution matrices obtained from a continuous-time Markov chain for...
A matrix Lie algebra is a linear space of matrices closed under the operation [A, B] = AB − BA. The ...
We present and explore a general method for deriving a Lie-Markov model from a finite semigroup. If ...
Recent work has discussed the importance of multiplicative closure for the Markov models used in phy...
Recent work has discussed the importance of multiplicative closure for the Markov mod- els used in ...
Continuous-time Markov chains are a standard tool in phylogenetic inference. If homogeneity is assum...
Various analyses of the Lie Markov models: Fourier-Motzkin elimination, nesting, equilibrium base fr...
Abstract. The standard theorem for stochastic matrices with positive entries is generalized to matri...
AbstractNotions of specification, implementation, satisfaction, and refinement, together with operat...
From the datum of an integer partition and a classical Lie algebra, one can define a Markov chain on...
International audienceNotions of specification, implementation, satisfaction, and refinement, togeth...
Notions of specification, implementation, satisfaction, and refinement, together with operators supp...
The attached file may be somewhat different from the published versionInternational audienceIn this ...
AbstractMarkov chains are widely used to determine system performance and reliability characteristic...