AbstractAn eigentime identity is proved for transient symmetrizable Markov chains. For general Markov chains, if the trace of Green matrix is finite, then the expectation of first leap time is uniformly bounded, both of which are proved to be equivalent for single birth processes. For birth–death processes, the explicit formulas are presented. As an application, we give the bounds of exponential convergence rates of (sub-) Markov semigroup Pt from l∞ to l∞
In this paper, we investigate computable lower bounds for the best strongly ergodic rate of converg...
Let {Pt'} t ^ 0} be a Markov semigroup arising from a standard, discrete state Markov chain in ...
AbstractWe consider the problem of giving explicit spectral bounds for time inhomogeneous Markov cha...
AbstractAn eigentime identity is proved for transient symmetrizable Markov chains. For general Marko...
International audienceConsider a finite irreducible Markov process $X$. Sampling two points $x$ and ...
This paper gives a stochastic representation in spectral terms for the absorption time T of a finite...
In this note it is shown how to construct a Markov chain whose sub-dominant eigenvalue does not pred...
In this note it is shown how to construct a Markov chain whose subdominant eigenvalue does not predi...
AbstractThis paper develops exponential type upper bounds for scaled occupation measures of singular...
International audienceConsider a finite irreducible Markov chain with invariant probability π. Defin...
AbstractFor finite Markov chains the eigenvalues of P can be used to characterize the chain and also...
In this thesis, we deal with the upper and lower bounds for the mixing time of reversi- ble homogene...
A stochastic matrix is "monotone" [4] if its row-vectors are stochastically increasing. Closure prop...
International audienceMarkov chains are a fundamental class of stochastic processes. They are widely...
Abstract: In this note, we present some observations related to piecewise deterministic Markov proce...
In this paper, we investigate computable lower bounds for the best strongly ergodic rate of converg...
Let {Pt'} t ^ 0} be a Markov semigroup arising from a standard, discrete state Markov chain in ...
AbstractWe consider the problem of giving explicit spectral bounds for time inhomogeneous Markov cha...
AbstractAn eigentime identity is proved for transient symmetrizable Markov chains. For general Marko...
International audienceConsider a finite irreducible Markov process $X$. Sampling two points $x$ and ...
This paper gives a stochastic representation in spectral terms for the absorption time T of a finite...
In this note it is shown how to construct a Markov chain whose sub-dominant eigenvalue does not pred...
In this note it is shown how to construct a Markov chain whose subdominant eigenvalue does not predi...
AbstractThis paper develops exponential type upper bounds for scaled occupation measures of singular...
International audienceConsider a finite irreducible Markov chain with invariant probability π. Defin...
AbstractFor finite Markov chains the eigenvalues of P can be used to characterize the chain and also...
In this thesis, we deal with the upper and lower bounds for the mixing time of reversi- ble homogene...
A stochastic matrix is "monotone" [4] if its row-vectors are stochastically increasing. Closure prop...
International audienceMarkov chains are a fundamental class of stochastic processes. They are widely...
Abstract: In this note, we present some observations related to piecewise deterministic Markov proce...
In this paper, we investigate computable lower bounds for the best strongly ergodic rate of converg...
Let {Pt'} t ^ 0} be a Markov semigroup arising from a standard, discrete state Markov chain in ...
AbstractWe consider the problem of giving explicit spectral bounds for time inhomogeneous Markov cha...