The connection between the mean first passage matrix of a finite homogeneous ergodic Markov chain and the group inverse of an associated M-matrix was described by Meyer. Using this connection between group inverses and the mean first passage times of finite ergodic Markov chains, we will derive new results regarding (i) the Kemeny constant of an ergodic chain, (ii) proximity in group inverses of M-matrices and its applications to Laplacians of graphs, (iii) the concavity or convexity of the Perron root when viewed as a differentiable function of the matrix entries, and (iv) Markov chain models of the small-world properties of a ring network.
By means of the concept of group inverse of a matrix we study limiting properties of a collection of...
For an n-state, homogeneous, ergodic Markov chain with a transition matrix T, its stationary distrib...
We consider a Markov chain with a general state space, but whose behavior is governed by finite matr...
The connection between the mean first passage matrix of a finite homogeneous ergodic Markov chain an...
AbstractIn this paper we connect, generalize, and broaden properties of matrices related to (i) the ...
The inverse mean first passage time problem is given a positive matrix M ∈ Rn,n, then when does ther...
AbstractThe inverse mean first passage time problem is given a positive matrix M∈Rn,n, then when doe...
AbstractIt is shown that, for a finite ergodic Markov chain, basic descriptive quantities, such as t...
A quantity known as the Kemeny constant, which is used to measure the expected number of links that...
AbstractA new approach to computing the mean first passage matrix for a finite ergodic Markov chain ...
A quantity known as the Kemeny constant, which is used to measure the expected number of links that ...
Computational procedures for the stationary probability distribution, the group inverse of the Marko...
AbstractLet P be the transition matrix for an n-state, homogeneous, ergodic Markov chain. Set Q=I−P ...
Questions are posed regarding the influence that the column sums of the transition probabilities of ...
The research presented in this paper is motivated by the growing interest in the analysis of network...
By means of the concept of group inverse of a matrix we study limiting properties of a collection of...
For an n-state, homogeneous, ergodic Markov chain with a transition matrix T, its stationary distrib...
We consider a Markov chain with a general state space, but whose behavior is governed by finite matr...
The connection between the mean first passage matrix of a finite homogeneous ergodic Markov chain an...
AbstractIn this paper we connect, generalize, and broaden properties of matrices related to (i) the ...
The inverse mean first passage time problem is given a positive matrix M ∈ Rn,n, then when does ther...
AbstractThe inverse mean first passage time problem is given a positive matrix M∈Rn,n, then when doe...
AbstractIt is shown that, for a finite ergodic Markov chain, basic descriptive quantities, such as t...
A quantity known as the Kemeny constant, which is used to measure the expected number of links that...
AbstractA new approach to computing the mean first passage matrix for a finite ergodic Markov chain ...
A quantity known as the Kemeny constant, which is used to measure the expected number of links that ...
Computational procedures for the stationary probability distribution, the group inverse of the Marko...
AbstractLet P be the transition matrix for an n-state, homogeneous, ergodic Markov chain. Set Q=I−P ...
Questions are posed regarding the influence that the column sums of the transition probabilities of ...
The research presented in this paper is motivated by the growing interest in the analysis of network...
By means of the concept of group inverse of a matrix we study limiting properties of a collection of...
For an n-state, homogeneous, ergodic Markov chain with a transition matrix T, its stationary distrib...
We consider a Markov chain with a general state space, but whose behavior is governed by finite matr...