Linear and Multilinear Algebra · 2013 · 186 citations · 20 references
EngineeringMathematicsProbability TheoryStochastic ModelingStochastic ProcessesMarkov ChainsMarkov ProcessesMulti-state ModelsConvergenceEigenvalue AlgorithmsFirst-order Markov ModelsHigher-order Markov ModelsLinear ConvergenceRandom Matrix TheoryTransition Probability MatrixTransition Probability Models
In this paper, we propose and develop an iterative method to calculate a limiting probability distribution vector of a transition probability tensor arising from a higher order Markov chain. In the model, the computation of such limiting probability distribution vector can be formulated as a -eigenvalue problem associated with the eigenvalue 1 of where all the entries of are required to be non-negative and its summation must be equal to one. This is an analog of the matrix case for a limiting probability vector of a transition probability matrix arising from the first-order Markov chain. We show that if is a transition probability tensor, then solutions of this -eigenvalue problem exist. When is irreducible, all the entries of solutions are positie. With some suitable conditions of , the limiting probability distribution vector is even unique. Under the same uniqueness assumption, the linear convergence of the iterative method can be established. Numerical examples are presented to illustrate the theoretical results of the proposed model and the iterative method.
20
The PageRank Citation Ranking : Bringing Order to the Web
Lawrence M. Page, Sergey Brin, Rajeev Motwani et al. · 1999 · 12.7K citations
Eigenvalues of a real supersymmetric tensor
Liqun Qi · Journal of Symbolic Computation · 2005 · 1.5K citations
Amy N. Langville, Carl D. Meyer · Internet Mathematics · 2004 · 908 citations · Full text