A Markov chain representation of the normalized Perron-Frobenius eigenvector
From MaRDI portal
Abstract: We consider the problem of finding the Perron-Frobenius eigenvector of a primitive matrix. Dividing each of the rows of the matrix by the sum of the elements in the row, the resulting new matrix is stochastic. We give a formula for the Perron-Frobenius eigenvector of the original matrix, in terms of a realization of the Markov chain defined by the associated stochastic matrix. This formula is a generalization of the classical formula for the invariant probability measure of a Markov chain.
Recommendations
- Galton–Watson and branching process representations of the normalized Perron–Frobenius eigenvector
- Uncoupling the Perron eigenvector problem
- Finding the stationary states of Markov chains by iterative methods
- Stationary distributions of perturbed Markov chains
- On the stability of the computation of the stationary probabilities of Markov chains using Perron complements
Cited in
(6)- Uncoupling the Perron eigenvector problem
- A note on Markov normalized magnetic eigenmaps
- Galton–Watson and branching process representations of the normalized Perron–Frobenius eigenvector
- Inequalities for functions of transition matrices
- On the Perron root and eigenvectors of a non-negative integer matrix
- Representation and characterization of quasistationary distributions for Markov chains
This page was built for publication: A Markov chain representation of the normalized Perron-Frobenius eigenvector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411774)
