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

DOI10.1007/BF01129890zbMATH Open0695.60074OpenAlexW2013544987MaRDI QIDQ910103FDOQ910103

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

Recommendations

• scientific article; zbMATH DE number 3921661
• Occupation times for countable Markov chains. III: Chains on a tree with one branching point
• Occupation times for countable Markov chains. II. Chains with continuous time
• Occupation times for countable Markov chains. I. Chains with discrete time
• scientific article; zbMATH DE number 2198007
• On mean recurrence times of Markov chains and spanning tree invariants
• A strong limit theorem for countable non-homogeneous Markov chains indexed by a tree
• Some limit results for Markov chains indexed by trees
• On the link between Markovian trees and tree-structured Markov chains
• Concentration of Markov chains indexed by trees

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

Cited In (3)

• On mean recurrence times of Markov chains and spanning tree invariants
• Title not available (Why is that?)
• 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

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