In an earlier paper the author introduced the statisticηi j ijπ j m = m = Σ 1 as a measure of the “mixing time” or “time to stationarity” in a finite irreducible discrete time Markov chain with stationary distribution {pj} and mij as the mean first passage time from state i to state j of the Markov chain. This was shown to be independent of the initial state i with ηi = η for all i, minimal in the case of a periodic chain, yet can be arbitrarily large in a variety of situations. In this paper we explore the variance of the mixing time vi , starting in state i. The vi , are shown to depend on i and an exploration of recommended starting states, given knowledge of the transition probabilities, is considered. As a preamble, a study of...
In this paper, we consider the extension of first passage probability. First, we present the first, ...
In this paper, the aim is to study similarities and differences between a continuous-time Markov cha...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...
AbstractIn an earlier paper [J.J. Hunter, Mixing times with applications to perturbed Markov chains,...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...
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...
AbstractFor finite irreducible discrete time Markov chains, whose transition probabilities are subje...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
AbstractConsider the class of discrete time, general state space Markov chains which satisfy a “unif...
AbstractThe purpose of this article is to present results concerning the sensitivity of the stationa...
AbstractStart two independent copies of a reversible Markov chain from arbitrary initial states. The...
Questions are posed regarding the influence that the column sums of the transition probabilities of ...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
In this thesis, we deal with the upper and lower bounds for the mixing time of reversi- ble homogene...
In this paper, we consider the extension of first passage probability. First, we present the first, ...
In this paper, the aim is to study similarities and differences between a continuous-time Markov cha...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...
AbstractIn an earlier paper [J.J. Hunter, Mixing times with applications to perturbed Markov chains,...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...
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...
AbstractFor finite irreducible discrete time Markov chains, whose transition probabilities are subje...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
AbstractConsider the class of discrete time, general state space Markov chains which satisfy a “unif...
AbstractThe purpose of this article is to present results concerning the sensitivity of the stationa...
AbstractStart two independent copies of a reversible Markov chain from arbitrary initial states. The...
Questions are posed regarding the influence that the column sums of the transition probabilities of ...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
In this thesis, we deal with the upper and lower bounds for the mixing time of reversi- ble homogene...
In this paper, we consider the extension of first passage probability. First, we present the first, ...
In this paper, the aim is to study similarities and differences between a continuous-time Markov cha...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...