arXiv subjects

Jeffrey J. Hunter

Publications and source records attributed to Jeffrey J. Hunter.

9 recordsLinked to original sources

arXiv2018

Why is Kemeny's constant a constant?

In their 1960 book on finite Markov chains, Kemeny and Snell established that a certain sum is invariant. The value of this sum has become known as {\it Kemeny's constant}. Various proofs have been given over time, some more technical than others. We give here a very simple physical justification, which extends without a hitch to continuous-time Markov chains on a finite state space. For Markov chains with denumerably infinite state space, the constant may be infinite and even if it is finite, there is no guarantee that the physical argument will hold. We show that the physical interpretation does go through for the special case of a birth-and-death process with a finite value of Kemeny's constant. Keywords: Kemeny's constant; discrete-time Markov chains; continuous-time Markov chains; passage times; deviation matrix.

math.PR↗

arXiv2016

The Computation of Key Properties of Markov Chains via Perturbations

Computational procedures for the stationary probability distribution, the group inverse of the Markovian kernel and the mean first passage times of an irreducible Markov chain, are developed using perturbations. The derivation of these expressions involves the solution of systems of linear equations and, structurally, inevitably the inverses of matrices. By using a perturbation technique, starting from a simple base where no such derivations are formally required, we update a sequence of matrices, formed by linking the solution procedures via generalized matrix inverses and utilising matrix and vector multiplications. Six different algorithms are given, some modifications are discussed, and numerical comparisons made using a test example. The derivations are based upon the ideas outlined in Hunter, J.J., The computation of stationary distributions of Markov chains through perturbations, Journal of Applied Mathematics and Stochastic Analysis, 4, 29-46, (1991).

math.PR↗

arXiv2016

Accurate calculations of stationary distributions and mean first passage times in Markov renewal processes and Markov chains

This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30,197-207, (1986) procedure. The technique is numerically stable in that it doesn't involve subtractions. Algebraic expressions for the special cases of one, two, three and four states are derived. A consequence of the procedure is that the stationary distribution of the embedded Markov chain does not need to be derived in advance but can be found accurately from the derived mean first passage times. MatLab is utilized to carry out the computations, using some test problems from the literature.

math.PR↗

arXiv2015

Why the Kemeny Time is a Constant

We present a new fundamental intuition for why the Kemeny feature of a Markov chain is a constant. This new perspective has interesting further implications

math.PR↗

arXiv2012

Generalized inverses of Markovian kernels in terms of properties of the Markov chain

All one-condition generalized inverses of the Markovian kernel I - P, where P is the transition matrix of a finite irreducible Markov chain, can be uniquely specified in terms of the stationary probabilities and the mean first passage times of the underlying Markov chain. Special sub-families include the group inverse of I - P, Kemeny and Snell's fundamental matrix of the Markov chain and the Moore-Penrose g-inverse. The elements of some sub-families of the generalized inverses can also be re-expressed involving the second moments of the recurrence time variables. Some applications to Kemeny's constant and perturbations of Markov chains are also considered.

math.PR↗

arXiv2012

The Role of Kemeny's Constant in Properties of Markov Chains

In a finite state irreducible Markov chain with stationary probabilities π_i and mean first passage times m_(ij) (mean recurrence time when i = j) it was first shown by Kemeny and Snell (1960) that \sum_j π_j m_(ij) is a constant K, not depending on i. This constant has since become known as Kemeny's constant. A variety of techniques for finding expressions and various bounds for K are derived. The main interpretation focuses on its role as the expected time to mixing in a Markov chain. Various applications are considered including perturbation results, mixing on directed graphs and its relation to the Kirchhoff index of regular graphs.

math.PR↗

arXiv2011

The Derivation of Markov Chain Properties using Generalized Matrix Inverses

The analysis of many problems of interest associated with Markov chains, e.g. stationary distributions, moments of first passage time distributions and moments of occupation time random variables, involves the solution of a system of linear equations involving I - P, where P is the transition matrix of a finite, irreducible, discrete time Markov chain. Generalized inverses play an important role in the solution of such singular sets of equations. In this presentation we survey the application of generalized matrix inverses to the aforementioned problems.

math.PR↗

arXiv2011

Markov chain properties in terms of column sums of the transition matrix

Questions are posed regarding the influence that the column sums of the transition probabilities of a stochastic matrix (with row sums all one) have on the stationary distribution, the mean first passage times and the Kemeny constant of the associated irreducible discrete time Markov chain. Some new relationships, including some inequalities, and partial answers to the questions, are given using a special generalized matrix inverse that has not previously been considered in the literature on Markov chains.

math.PR↗

arXiv2011

The Distribution of Mixing Times in Markov Chains

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 times, Linear Algebra Appl. 429 (2008) 1135-1162]. Some new results for the distribution of recurrence and first passage times in three-state Markov chain are also presented.

math.PR↗