Occupation times for countable Markov chains. I. Chains with discrete time
From MaRDI portal
Publication:800045
DOI10.1007/BF01843546zbMath0549.60061OpenAlexW2045918200MaRDI QIDQ800045
Publication date: 1984
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01843546
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Local time and additive functionals (60J55)
Related Items (3)
Occupation times for countable Markov chains. III: Chains on a tree with one branching point ⋮ Dwelling time for countable Markov chains. IV: Chains on an arbitrary tree ⋮ Occupation times for countable Markov chains. II. Chains with continuous time
Cites Work
- The Frequency Count of a Markov Chain and the Transition to Continuous Time
- Some Properties of Regular Markov Chains
- The joint probability density function of the occupation time of a three-state problem
- The joint distribution of occupation totals for a simple random walk
- On the joint limiting distribution of times spent in particular states by a Markov process
This page was built for publication: Occupation times for countable Markov chains. I. Chains with discrete time
