We consider an absorbing Markov Chain that a result of an aggregation finite Markov Chain of higher dimension with respect to the partition)(tY)(tX A and unknown transition probability matrix (t.p.m) P, the question of whether is(not) also absorbing will be study for the lumped and the weakly lumped absorbing Markov Chain for all (certain) partitions within isomorphic with respect to the cases (k, k+1) and (2, k). Special cases will be introduced for each case, for each partition.)(t
AbstractThe technique of lumping of Markov chains is one of the main tools for recovering from state...
In this thesis, we explore Markov chains with random transition matrices. Such chains are a developm...
A class of Markov chains we call successively lumpable is specified for which it is shown that the s...
An irreducible and homogeneous Markov chain with finite state space is considered. Under a mild cond...
In this thesis, the theory of lumpability (strong lumpability and weak lumpability) of irreducible f...
Under certain conditions the state space of a discrete parameter Markov chain may be partitioned to ...
We consider weak lumpability of general finite homogeneous Markov chains evolving in discrete time, ...
The attached file may be somewhat different from the published versionInternational audienceWe consi...
We consider weak lumpability of denumerable discrete or continuous time Markov chains. Firstly, we a...
The technique of lumping of Markov chains is one of the main tools for recovering from state explosi...
AbstractWe consider an irreducible and homogeneous Markov chain (discrete time) with finite state sp...
This note considers continuous-time Markov chains whose state space consists of an irreducible class...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
The attached file may be somewhat different from the published versionInternational audienceWe chara...
A Markov chain which transition matrix and a semi-Markov chain which embedded Markov transition matr...
AbstractThe technique of lumping of Markov chains is one of the main tools for recovering from state...
In this thesis, we explore Markov chains with random transition matrices. Such chains are a developm...
A class of Markov chains we call successively lumpable is specified for which it is shown that the s...
An irreducible and homogeneous Markov chain with finite state space is considered. Under a mild cond...
In this thesis, the theory of lumpability (strong lumpability and weak lumpability) of irreducible f...
Under certain conditions the state space of a discrete parameter Markov chain may be partitioned to ...
We consider weak lumpability of general finite homogeneous Markov chains evolving in discrete time, ...
The attached file may be somewhat different from the published versionInternational audienceWe consi...
We consider weak lumpability of denumerable discrete or continuous time Markov chains. Firstly, we a...
The technique of lumping of Markov chains is one of the main tools for recovering from state explosi...
AbstractWe consider an irreducible and homogeneous Markov chain (discrete time) with finite state sp...
This note considers continuous-time Markov chains whose state space consists of an irreducible class...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
The attached file may be somewhat different from the published versionInternational audienceWe chara...
A Markov chain which transition matrix and a semi-Markov chain which embedded Markov transition matr...
AbstractThe technique of lumping of Markov chains is one of the main tools for recovering from state...
In this thesis, we explore Markov chains with random transition matrices. Such chains are a developm...
A class of Markov chains we call successively lumpable is specified for which it is shown that the s...