Occupation times for countable Markov chains. III: Chains on a tree with one branching point
type: Item
instance of: scholarly article
title: Occupation times for countable Markov chains. III: Chains on a tree with one branching point
zbMATH Open document ID: 0612.60062
DOI: 10.1007/BF01663453
author: S. S. Vallander
published in: Journal of Soviet Mathematics
publication date: 1987-01-01T00:00:00Z
review text: Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 142, 25-38 (Russian) (1985; Zbl 0576.60066). For Part II see ibid. 130, 56-64 (1983; Zbl 0539.60062); English translation in J. Sov. Math. 27, 3203-3208 (1984).
Mathematics Subject Classification ID: 60J27
zbMATH DE Number: 3990539
zbMATH Keywords: sojourn time
zbMATH Keywords: transition graph of process
zbMATH Keywords: Markov property of the field
zbMATH Keywords: Green functions
MaRDI profile type: Publication
cites work: Occupation times for countable Markov chains. I. Chains with discrete time
cites work: Occupation times for countable Markov chains. II. Chains with continuous time
cites work: Gibbs States on Countable Sets
full work available at URL: https://doi.org/10.1007/bf01663453
OpenAlex ID: W2088574649
description: scientific article; zbMATH DE number 3990539