AbstractIt is shown that, for a finite ergodic Markov chain, basic descriptive quantities, such as the stationary vector and mean first-passage matrix, may be calculated using any one of a class of fundamental matrices. New applications of the use of these operators are discussed
AbstractWe extend the concept of the “fundamental matrix” to semi-Markov processes and derive variou...
The finiteness of the mean visit time to state j is used in the characterization of uniform strong e...
For an arbitrary subset A of the finite state space 5 of a Markov chain the so–called embedded matri...
AbstractIt is shown that, for a finite ergodic Markov chain, basic descriptive quantities, such as t...
AbstractA new approach to computing the mean first passage matrix for a finite ergodic Markov chain ...
We consider a Markov chain with a general state space, but whose behavior is governed by finite matr...
AbstractWe consider a Markov chain with a general state space, but whose behavior is governed by fin...
The connection between the mean first passage matrix of a finite homogeneous ergodic Markov chain an...
To study finite Markov chains, we begin with the theory of order relations to classify states and ch...
AbstractPotential Theory for ergodic Markov chains (with a discrete state spare and a continuous par...
AbstractThe inverse mean first passage time problem is given a positive matrix M∈Rn,n, then when doe...
For a Їnite state homogeneous Markov chain with circulant transition matrix that describes shift re...
Abstract. In this paper, I will buildup the basic framework of Markov Chains over finite state space...
The inverse mean first passage time problem is given a positive matrix M ∈ Rn,n, then when does ther...
A treatment is given of a probabilistic approach, Algorithm H, to the determination of the fundament...
AbstractWe extend the concept of the “fundamental matrix” to semi-Markov processes and derive variou...
The finiteness of the mean visit time to state j is used in the characterization of uniform strong e...
For an arbitrary subset A of the finite state space 5 of a Markov chain the so–called embedded matri...
AbstractIt is shown that, for a finite ergodic Markov chain, basic descriptive quantities, such as t...
AbstractA new approach to computing the mean first passage matrix for a finite ergodic Markov chain ...
We consider a Markov chain with a general state space, but whose behavior is governed by finite matr...
AbstractWe consider a Markov chain with a general state space, but whose behavior is governed by fin...
The connection between the mean first passage matrix of a finite homogeneous ergodic Markov chain an...
To study finite Markov chains, we begin with the theory of order relations to classify states and ch...
AbstractPotential Theory for ergodic Markov chains (with a discrete state spare and a continuous par...
AbstractThe inverse mean first passage time problem is given a positive matrix M∈Rn,n, then when doe...
For a Їnite state homogeneous Markov chain with circulant transition matrix that describes shift re...
Abstract. In this paper, I will buildup the basic framework of Markov Chains over finite state space...
The inverse mean first passage time problem is given a positive matrix M ∈ Rn,n, then when does ther...
A treatment is given of a probabilistic approach, Algorithm H, to the determination of the fundament...
AbstractWe extend the concept of the “fundamental matrix” to semi-Markov processes and derive variou...
The finiteness of the mean visit time to state j is used in the characterization of uniform strong e...
For an arbitrary subset A of the finite state space 5 of a Markov chain the so–called embedded matri...
DOI
Add to ORKG