Multiplicative processes reaching stationarity in finite time
From MaRDI portal
Publication:790541
DOI10.1016/0024-3795(83)90174-XzbMath0534.60063MaRDI QIDQ790541
Uriel G. Rothblum, Choon Peng Tan
Publication date: 1983
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic matrices (15B51)
Related Items (2)
Asymptotic properties of powers of nonnegative matrices, with applications ⋮ Nonnegative multiplicative processes reaching stationarity in finite time
Cites Work
- Ergodic Markov chains with finite convergence time
- Non-negative matrices and Markov chains. 2nd ed
- On the class of Markov chains with finite convergence time
- Markov chains with finite convergence time
- Multiplicative Markov Decision Chains
- Finite Continuous Time Markov Chains
- A Necessary and Sufficient Condition for Reaching a Consensus Using DeGroot's Method
- Expansions of Sums of Matrix Powers
- Sensitive Growth Analysis of Multiplicative Systems I: The Dynamic Approach
- Growth Optimality for Branching Markov Decision Chains
- Ergodic theorems in demography
- Reaching a Consensus
- Dynamics of the Peter Principle
- Risk-Sensitive Markov Decision Processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multiplicative processes reaching stationarity in finite time
