Occupation times for countable Markov chains. I. Chains with discrete time

DOI10.1007/BF01843546zbMATH Open0549.60061OpenAlexW2045918200MaRDI QIDQ800045FDOQ800045

Authors: S. S. Vallander 

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

zbMATH Keywords

occupation timesconditional Markov property

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Local time and additive functionals (60J55)

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

Cited In (6)

• Occupation time of a renewal process coupled to a discrete Markov chain
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dwelling time for countable Markov chains. IV: Chains on an arbitrary tree
• Occupation times for countable Markov chains. II. Chains with continuous time
• Occupation times for countable Markov chains. III: Chains on a tree with one branching point

This page was built for publication: Occupation times for countable Markov chains. I. Chains with discrete time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800045)