enin et al. (2000) recently introduced the idea of similarity in the context of birth-death processes. This paper examines the extent to which their results can be extended to arbitrary Markov chains. It is proved that, under a variety of conditions, similar chains are strongly similar in a sense which is described, and it is shown that minimal chains are strongly similar if and only if the corresponding transition-rate matrices are strongly similar. A general framework is given for constructing families of strongly similar chains; it permits the construction of all such chains in the irreducible case
In this paper, we describe a link between Markovian binary trees (MBT) and tree-like quasi-birth-and...
In this work we introduce new approximate similarity relations that are shown to be key for policy (...
AbstractA new class of operators performing an optimization (optimization operators or, simply, opti...
Abstract: This note surveys some recent results on self-similar Markov processes. Since the research...
We consider birth-death processes taking values in N ≡ {0,1,... }, but allow the death rate in state...
We consider birth-death processes taking values in N ≡ {0,1,... }, but allow the death rate in state...
We derive necessary and sufficient conditions for the existence of bounded or summable solutions to ...
International audienceTwo finite Markov generators $L$ and $\widetilde L$ are said to be intertwined...
AbstractIt is proved that there exist two Markov transition matrices which are not identical but whi...
AbstractSuppose two stochastic matrices A and B of order n are similar in the set of all matrices o...
50 pagesInternational audienceThe first aim of this paper is to introduce a class of Markov chains o...
A transition matrix U_{i,j} i,j≥0 on N is said to be almost upper triangular if U_{i,j} ≥ 0 ⇒ j ≥ i ...
A similarity transformation is obtained between general population matrices models of the Usher or L...
Markov chains are considered with emphasis on the compution of exact and approximate stationary dist...
A classical result, due to Lamperti, establishes a one-to-one correspondence between a class of stri...
In this paper, we describe a link between Markovian binary trees (MBT) and tree-like quasi-birth-and...
In this work we introduce new approximate similarity relations that are shown to be key for policy (...
AbstractA new class of operators performing an optimization (optimization operators or, simply, opti...
Abstract: This note surveys some recent results on self-similar Markov processes. Since the research...
We consider birth-death processes taking values in N ≡ {0,1,... }, but allow the death rate in state...
We consider birth-death processes taking values in N ≡ {0,1,... }, but allow the death rate in state...
We derive necessary and sufficient conditions for the existence of bounded or summable solutions to ...
International audienceTwo finite Markov generators $L$ and $\widetilde L$ are said to be intertwined...
AbstractIt is proved that there exist two Markov transition matrices which are not identical but whi...
AbstractSuppose two stochastic matrices A and B of order n are similar in the set of all matrices o...
50 pagesInternational audienceThe first aim of this paper is to introduce a class of Markov chains o...
A transition matrix U_{i,j} i,j≥0 on N is said to be almost upper triangular if U_{i,j} ≥ 0 ⇒ j ≥ i ...
A similarity transformation is obtained between general population matrices models of the Usher or L...
Markov chains are considered with emphasis on the compution of exact and approximate stationary dist...
A classical result, due to Lamperti, establishes a one-to-one correspondence between a class of stri...
In this paper, we describe a link between Markovian binary trees (MBT) and tree-like quasi-birth-and...
In this work we introduce new approximate similarity relations that are shown to be key for policy (...
AbstractA new class of operators performing an optimization (optimization operators or, simply, opti...