Dwelling time for countable Markov chains. IV: Chains on an arbitrary tree

DOI10.1007/BF01129890zbMath0695.60074OpenAlexW2013544987MaRDI QIDQ910103

S. S. Vallander

Publication date: 1988

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01129890

zbMATH Keywords

Green functionMarkov fieldoccupation time field

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27)

Cites Work

• Occupation times for countable Markov chains. I. Chains with discrete time
• 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: Dwelling time for countable Markov chains. IV: Chains on an arbitrary tree