S. S. Vallander, “Occupation times for countable Markov chains. IV. Chains on a general tree”, Problems of the theory of probability distributions. Part X, Zap. Nauchn. Sem. LOMI, 158, "Nauka", Leningrad. Otdel., Leningrad, 1987, 39

Zapiski Nauchnykh Seminarov LOMI

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Zapiski Nauchnykh Seminarov LOMI, 1987, Volume 158, Pages 39–44 (Mi znsl5373)

This article is cited in 2 scientific papers (total in 2 papers)

Occupation times for countable Markov chains. IV. Chains on a general tree

S. S. Vallander

Full-text PDF (379 kB) Citations (2)

Abstract: The results of the author's preceding paper are carried over to a larger class of Markov chains. The Markov property of the dwelling time field is proved for chains with continuous time.

Bibliographic databases:

Document Type: Article

UDC: 519.2

Language: Russian

Citation: S. S. Vallander, “Occupation times for countable Markov chains. IV. Chains on a general tree”, Problems of the theory of probability distributions. Part X, Zap. Nauchn. Sem. LOMI, 158, "Nauka", Leningrad. Otdel., Leningrad, 1987, 39–44

Citation in format AMSBIB

\Bibitem{Val87}

\by S.~S.~Vallander

\paper Occupation times for countable Markov chains.~IV. Chains on a general tree

\inbook Problems of the theory of probability distributions. Part~X

\serial Zap. Nauchn. Sem. LOMI

\yr 1987

\vol 158

\pages 39--44

\publ "Nauka", Leningrad. Otdel.

\publaddr Leningrad

\mathnet{http://mi.mathnet.ru/znsl5373}

\zmath{https://zbmath.org/?q=an:0695.60074}

Linking options:

https://www.mathnet.ru/eng/znsl5373

https://www.mathnet.ru/eng/znsl/v158/p39

Cycle of papers

Occupation times for countable Markov chains. I. Chains with discrete time.
S. S. Vallander
Zap. Nauchn. Sem. LOMI, 1982, 119, 39–61
Occupation times for countable Markov chairus. II. Chains with continuous time
S. S. Vallander
Zap. Nauchn. Sem. LOMI, 1983, 130, 56–64
Occupation times for countable Markov chains III. Chains on a tree with one branching point
S. S. Vallander
Zap. Nauchn. Sem. LOMI, 1985, 142, 25–38
Occupation times for countable Markov chains. IV. Chains on a general tree
S. S. Vallander
Zap. Nauchn. Sem. LOMI, 1987, 158, 39–44

This publication is cited in the following 2 articles:

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	89
Full-text PDF :	41

Что такое QR-код?

Registration to the website

Logotypes