S. S. Vallander, “Occupation times for countable Markov chairus. II. Chains with continuous time”, Problems of the theory of probability distributions. Part VIII, Zap. Nauchn. Sem. LOMI, 130, "Nauka", Leningrad. Otdel., Leningrad, 1983, 56

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, 1983, Volume 130, Pages 56–64 (Mi znsl4333)

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

Occupation times for countable Markov chairus. II. Chains with continuous time

S. S. Vallander

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

Abstract: She results of the Part I are transferred to Markov chains with continuous time. In contrast to the discrete time case we state the Markov property of the occupation time process for the simplest one-dimensional symmetric random walk with continuous time.

Bibliographic databases:

Document Type: Article

UDC: 519.2

Language: Russian

Citation: S. S. Vallander, “Occupation times for countable Markov chairus. II. Chains with continuous time”, Problems of the theory of probability distributions. Part VIII, Zap. Nauchn. Sem. LOMI, 130, "Nauka", Leningrad. Otdel., Leningrad, 1983, 56–64

Citation in format AMSBIB

\Bibitem{Val83}

\by S.~S.~Vallander

\paper Occupation times for countable Markov chairus.~II. Chains with continuous time

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

\serial Zap. Nauchn. Sem. LOMI

\yr 1983

\vol 130

\pages 56--64

\publ "Nauka", Leningrad. Otdel.

\publaddr Leningrad

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

\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=723670}

Linking options:

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

https://www.mathnet.ru/eng/znsl/v130/p56

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:	159
Full-text PDF :	63

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

Registration to the website

Logotypes