The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible Markov chain, starting in state i, can be defined as the number of trials to reach a state sampled from the stationary distribution of the Markov chain. Expressions for the probability generating function, and hence the probability distribution of the mixing time starting in state i are derived and special cases explored. This extends the results of the author regarding the expected time to mixing [J.J. Hunter, Mixing times with applications to perturbed Markov chains, Linear Algebra Appl. 417 (2006) 108–123], and the variance of the times to mixing, [J.J. Hunter, Variances of first passage times in a Markov chain with applications to mixing t...
The focus of the thesis is the convergence of irreducible aperiodic homoge- neous Markov chains with...
In this thesis, we deal with the upper and lower bounds for the mixing time of reversi- ble homogene...
We determine the mixing time (up to a constant factor) of the Markov chain whose state space consist...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...
AbstractIn an earlier paper [J.J. Hunter, Mixing times with applications to perturbed Markov chains,...
AbstractA measure of the “mixing time” or “time to stationarity” in a finite irreducible discrete ti...
In an earlier paper the author introduced the statisticηi j ijπ j m = m = Σ 1 as a measure of the ...
The derivation of the expected time to coupling in a Markov chain and its relation to the expected t...
AbstractThe derivation of the expected time to coupling in a Markov chain and its relation to the ex...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...
AbstractConsider the class of discrete time, general state space Markov chains which satisfy a “unif...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
This book is an introduction to the modern approach to the theory of Markov chains. The main goal of...
AbstractFor finite irreducible discrete time Markov chains, whose transition probabilities are subje...
Mixing and hitting times are fundamental parameters of a Markov chain. In this mini-course I will di...
The focus of the thesis is the convergence of irreducible aperiodic homoge- neous Markov chains with...
In this thesis, we deal with the upper and lower bounds for the mixing time of reversi- ble homogene...
We determine the mixing time (up to a constant factor) of the Markov chain whose state space consist...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...
AbstractIn an earlier paper [J.J. Hunter, Mixing times with applications to perturbed Markov chains,...
AbstractA measure of the “mixing time” or “time to stationarity” in a finite irreducible discrete ti...
In an earlier paper the author introduced the statisticηi j ijπ j m = m = Σ 1 as a measure of the ...
The derivation of the expected time to coupling in a Markov chain and its relation to the expected t...
AbstractThe derivation of the expected time to coupling in a Markov chain and its relation to the ex...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...
AbstractConsider the class of discrete time, general state space Markov chains which satisfy a “unif...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
This book is an introduction to the modern approach to the theory of Markov chains. The main goal of...
AbstractFor finite irreducible discrete time Markov chains, whose transition probabilities are subje...
Mixing and hitting times are fundamental parameters of a Markov chain. In this mini-course I will di...
The focus of the thesis is the convergence of irreducible aperiodic homoge- neous Markov chains with...
In this thesis, we deal with the upper and lower bounds for the mixing time of reversi- ble homogene...
We determine the mixing time (up to a constant factor) of the Markov chain whose state space consist...