Occupation times for countable Markov chains. III: Chains on a tree with one branching point

DOI10.1007/BF01663453zbMath0612.60062OpenAlexW2088574649MaRDI QIDQ1088299

S. S. Vallander

Publication date: 1987

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

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

zbMATH Keywords

Green functionssojourn timeMarkov property of the fieldtransition graph of process

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Occupation times for countable Markov chains. I. Chains with discrete time
• Occupation times for countable Markov chains. II. Chains with continuous time
• Gibbs States on Countable Sets

This page was built for publication: Occupation times for countable Markov chains. III: Chains on a tree with one branching point