Multiplicative processes reaching stationarity in finite time
From MaRDI portal
Publication:790541
DOI10.1016/0024-3795(83)90174-XzbMATH Open0534.60063MaRDI QIDQ790541FDOQ790541
Authors: Uriel G. Rothblum, Choon Peng Tan
Publication date: 1983
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic matrices (15B51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reaching a Consensus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-negative matrices and Markov chains. 2nd ed
- Title not available (Why is that?)
- Title not available (Why is that?)
- Risk-Sensitive Markov Decision Processes
- Finite Continuous Time Markov Chains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiplicative Markov Decision Chains
- A Necessary and Sufficient Condition for Reaching a Consensus Using DeGroot's Method
- Ergodic theorems in demography
- Sensitive Growth Analysis of Multiplicative Systems I: The Dynamic Approach
- Expansions of Sums of Matrix Powers
- Ergodic Markov chains with finite convergence time
- On the class of Markov chains with finite convergence time
- Markov chains with finite convergence time
- Title not available (Why is that?)
- Growth Optimality for Branching Markov Decision Chains
- Dynamics of the Peter Principle
Cited In (4)
This page was built for publication: Multiplicative processes reaching stationarity in finite time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790541)