Add to ORKGIn this paper, we investigate computable lower bounds for the best strongly ergodic rate of convergence of the transient probability distribution to the stationary distribution for stochastically monotone continuous-time Markov chains and reversible ones, using a drift function and the expectation of the first hitting time on some state. We apply these results to birth-death processes, branching processes and population processes. doi:10.1017/S144618110800011
We continue the work of improving the rate of convergence of ergodic homogeneous Markov chains. The ...
In this paper we give bounds on the total variation distance from convergence of a continuous time p...
In this paper we give bounds on the total variation distance from convergence of a continuous time p...
In this paper, we investigate computable lower bounds for the best strongly ergodic rate of converg...
In this paper, we investigate computable lower bounds for the best strongly ergodic rate of converg...
AbstractIn this paper, subgeometric ergodicity is investigated for continuous-time Markov chains. Se...
We give computable bounds on the rate of convergence of the transition probabil-ities to the station...
communicated by I. Pinelis Abstract. For the distribution of a finite, homogeneous, continuous-time ...
AbstractA coupling method is used to obtain the explicit upper and lower bounds for convergence rate...
In this paper, we give quantitative bounds on the $f$-total variation distance from convergence of a...
In this paper, we give quantitative bounds on the $f$-total variation distance from convergence of a...
International audienceLet Q be a transition probability on a measurable space E which admits an inva...
New improved rates of convergence for ergodic homogeneous Markov chains are studied. Examples of com...
Let (Phi(t))(t is an element of R+) be a Harris ergodic continuous-time Markov process on a general ...
AbstractThis paper studies the equivalence of exponential ergodicity and L2-exponential convergence ...
We continue the work of improving the rate of convergence of ergodic homogeneous Markov chains. The ...
In this paper we give bounds on the total variation distance from convergence of a continuous time p...
In this paper we give bounds on the total variation distance from convergence of a continuous time p...
In this paper, we investigate computable lower bounds for the best strongly ergodic rate of converg...
In this paper, we investigate computable lower bounds for the best strongly ergodic rate of converg...
AbstractIn this paper, subgeometric ergodicity is investigated for continuous-time Markov chains. Se...
We give computable bounds on the rate of convergence of the transition probabil-ities to the station...
communicated by I. Pinelis Abstract. For the distribution of a finite, homogeneous, continuous-time ...
AbstractA coupling method is used to obtain the explicit upper and lower bounds for convergence rate...
In this paper, we give quantitative bounds on the $f$-total variation distance from convergence of a...
In this paper, we give quantitative bounds on the $f$-total variation distance from convergence of a...
International audienceLet Q be a transition probability on a measurable space E which admits an inva...
New improved rates of convergence for ergodic homogeneous Markov chains are studied. Examples of com...
Let (Phi(t))(t is an element of R+) be a Harris ergodic continuous-time Markov process on a general ...
AbstractThis paper studies the equivalence of exponential ergodicity and L2-exponential convergence ...
We continue the work of improving the rate of convergence of ergodic homogeneous Markov chains. The ...
In this paper we give bounds on the total variation distance from convergence of a continuous time p...
In this paper we give bounds on the total variation distance from convergence of a continuous time p...