Expected Times for Reaching a Level for Range Type Functionals of a Markov Chain
โ Scribed by Filonov, Yu. P.
- Book ID
- 118220526
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1984
- Tongue
- English
- Weight
- 549 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0040-585X
- DOI
- 10.1137/1128083
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
For an irreducible stochastic matrix T, the Kemeny constant K(T) measures the expected time to mixing of the Markov chain corresponding to T. Given a strongly connected directed graph D, we consider the set ฮฃ D of stochastic matrices whose directed graph is subordinate to D, and compute the minimum
We prove a representation formula for the rate function of the Large Deviation Principle for the empirical distribution of an irreducible continuous time Markov process on a finite state space. We use this representation to characterize asymptotically efficient intensities for the Monte Carlo evalua