This paper gives a stochastic representation in spectral terms for the absorption time T of a finite Markov chain which is irreducible and reversible outside the absorbing point. This yields quantitative informations on the parameters of a similar representation due to O'Cinneide for general chains admitting real eigenvalues. In the discrete time setting, if the underlying Dirichlet eigenvalues (namely the eigenvalues of the Markov transition operator restricted to the functions vanishing on the absorbing point) are nonnegative, we show that T is distributed as a mixture of sums of independent geometric laws whose parameters are successive Dirichlet eigenvalues (starting from the smallest one). The mixture weights depend on the starting l...
Abstract For continuous-time ergodic Markov processes, the Kemeny time τ ∗ is the characteristic tim...
The quantitative long time behavior of absorbing, finite, irreducible Markov processes is considered...
In this paper, we compute the absorbing time Tn of a n-dimensional discrete time Markov chain made o...
This paper gives a stochastic representation in spectral terms for the absorption time T of a finite...
Abstract. This paper gives a stochastic representation in spectral terms for the absorption time T o...
34 pagesInternational audienceThis paper gives a stochastic representation in spectral terms for the...
International audienceConsider a finite irreducible Markov process $X$. Sampling two points $x$ and ...
In this thesis, we deal with the upper and lower bounds for the mixing time of reversi- ble homogene...
We consider discrete-time Markov chains with one coffin state and a finite set $S$ of transient stat...
We consider a general class of discrete, two-dimensional Markov chains modeling the dynamics of a po...
International audienceIn this paper, we compute the absorbing time Tn of a n-dimensional discrete ti...
International audienceConsider a finite absorbing Markov generator, irreducible on the non-absorbing...
We continue the study of a particle (atom, molecule) undergoing an unbiased random walk on the Sierp...
AbstractAn eigentime identity is proved for transient symmetrizable Markov chains. For general Marko...
58 pagesInternational audienceWe consider stochastic differential equations, obtained by adding weak...
Abstract For continuous-time ergodic Markov processes, the Kemeny time τ ∗ is the characteristic tim...
The quantitative long time behavior of absorbing, finite, irreducible Markov processes is considered...
In this paper, we compute the absorbing time Tn of a n-dimensional discrete time Markov chain made o...
This paper gives a stochastic representation in spectral terms for the absorption time T of a finite...
Abstract. This paper gives a stochastic representation in spectral terms for the absorption time T o...
34 pagesInternational audienceThis paper gives a stochastic representation in spectral terms for the...
International audienceConsider a finite irreducible Markov process $X$. Sampling two points $x$ and ...
In this thesis, we deal with the upper and lower bounds for the mixing time of reversi- ble homogene...
We consider discrete-time Markov chains with one coffin state and a finite set $S$ of transient stat...
We consider a general class of discrete, two-dimensional Markov chains modeling the dynamics of a po...
International audienceIn this paper, we compute the absorbing time Tn of a n-dimensional discrete ti...
International audienceConsider a finite absorbing Markov generator, irreducible on the non-absorbing...
We continue the study of a particle (atom, molecule) undergoing an unbiased random walk on the Sierp...
AbstractAn eigentime identity is proved for transient symmetrizable Markov chains. For general Marko...
58 pagesInternational audienceWe consider stochastic differential equations, obtained by adding weak...
Abstract For continuous-time ergodic Markov processes, the Kemeny time τ ∗ is the characteristic tim...
The quantitative long time behavior of absorbing, finite, irreducible Markov processes is considered...
In this paper, we compute the absorbing time Tn of a n-dimensional discrete time Markov chain made o...