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 [Hunter, J J (2006). Mixing times with applications to perturbed Markov chains. Linear Algebra and its Applications, 417, 108-123] and the variance of the times to mixing, [Hunter, J J (2008). Variances of First Passage Times in a Markov chain with...
A numerical method to approximate first passage times distributions in direct Markov processes will...
Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of tech...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...
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,...
In an earlier paper the author introduced the statisticηi j ijπ j m = m = Σ 1 as a measure of the ...
AbstractA measure of the “mixing time” or “time to stationarity” in a finite irreducible discrete ti...
AbstractThe derivation of the expected time to coupling in a Markov chain and its relation to the ex...
AbstractConsider the class of discrete time, general state space Markov chains which satisfy a “unif...
The derivation of the expected time to coupling in a Markov chain and its relation to the expected t...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
AbstractFor finite irreducible discrete time Markov chains, whose transition probabilities are subje...
We tackle the problem of estimating the mixing time of a Markov chain from a single trajectory of ob...
Consider a Markov chain with finite state space and suppose you wish to change time replacing the in...
A numerical method to approximate first passage times distributions in direct Markov processes will...
Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of tech...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...
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,...
In an earlier paper the author introduced the statisticηi j ijπ j m = m = Σ 1 as a measure of the ...
AbstractA measure of the “mixing time” or “time to stationarity” in a finite irreducible discrete ti...
AbstractThe derivation of the expected time to coupling in a Markov chain and its relation to the ex...
AbstractConsider the class of discrete time, general state space Markov chains which satisfy a “unif...
The derivation of the expected time to coupling in a Markov chain and its relation to the expected t...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
AbstractFor finite irreducible discrete time Markov chains, whose transition probabilities are subje...
We tackle the problem of estimating the mixing time of a Markov chain from a single trajectory of ob...
Consider a Markov chain with finite state space and suppose you wish to change time replacing the in...
A numerical method to approximate first passage times distributions in direct Markov processes will...
Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of tech...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...