A probabilistic proof of the <scp>Perron–Frobenius</scp> theorem
From MaRDI portal
Publication:6079112
Abstract: The Perron-Frobenius theorem plays an important role in many areas of management science and operations research. This paper provides a probabilistic perspective on the theorem, by discussing a proof that exploits a probabilistic representation of the Perron-Frobenius eigenvalue and eigenvectors in terms of the dynamics of a Markov chain. The proof provides conditions in both the finite-dimensional and infinite-dimensional settings under which the Perron-Frobenius eigenvalue and eigenvectors exist. Furthermore, the probabilistic representations that arise can be used to produce a Monte Carlo algorithm for computing the Perron-Frobenius eigenvalue and eigenvectors that will be explored elsewhere.
Recommendations
Cites work
- Extensions of Jentzsch's Theorem
- General Irreducible Markov Chains and Non-Negative Operators
- Growth Optimality for Branching Markov Decision Chains
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3538576 (Why is no real title available?)
- scientific article; zbMATH DE number 3638844 (Why is no real title available?)
- scientific article; zbMATH DE number 3408613 (Why is no real title available?)
- scientific article; zbMATH DE number 3195751 (Why is no real title available?)
- scientific article; zbMATH DE number 3046902 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- Markov additive processes. I: Eigenvalue properties and limit theorems
- Markov chains and stochastic stability
- Multiplicative Markov Decision Chains
- Non-negative matrices and Markov chains. 2nd ed
- Optimization of Multitype Branching Processes
Cited in
(13)- The Perron-Frobenius theorem -- a proof with the use of Markov chains
- Projection theorems for hitting probabilities and a theorem of Littlewood
- A constructive proof of the Gelfand--Kolmogorov theorem
- Proof of Tomaszewski's conjecture on randomly signed sums
- Deductive proofs of almost sure persistence and recurrence properties
- A probabilistic version of a theorem of Kegel.
- A probabilistic proof of Schoenberg's theorem
- A Probabilistic Proof of the Multinomial Theorem
- scientific article; zbMATH DE number 3890084 (Why is no real title available?)
- A probabilistic proof of the fundamental theorem of algebra
- PROBABILISTIC PROOF OF LIMIT THEOREMS IN NUMBER THEORY BY MEANS OF ADELES
- The Cerny Conjecture Holds with High Probability
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
This page was built for publication: A probabilistic proof of the <scp>Perron–Frobenius</scp> theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6079112)