S. S. Vallander, “Occupation times for countable Markov chains. I. Chains with discrete time.”, Problems of the theory of probability distributions. Part VII, Zap. Nauchn. Sem. LOMI, 119, "Nauka", Leningrad. Otdel., Leningrad, 1982, 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, 1982, Volume 119, Pages 39–61 (Mi znsl3984)

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

Occupation times for countable Markov chains. I. Chains with discrete time.

S. S. Vallander

Citations (2)

Abstract: The analogs of Ray descreption of local time for the onedimensional Brownian motion are obtained, which are true for all countable Markov chains with discrete time and stationary tranition probabilities. Contrary to the case of Brownian motion, the absence of Markov property of the occupation time process in the case of the simplest one-dimensional symmetric random walk is established.

Bibliographic databases:

Document Type: Article

UDC: 519.2

Language: Russian

Citation: S. S. Vallander, “Occupation times for countable Markov chains. I. Chains with discrete time.”, Problems of the theory of probability distributions. Part VII, Zap. Nauchn. Sem. LOMI, 119, "Nauka", Leningrad. Otdel., Leningrad, 1982, 39–61

Citation in format AMSBIB

\Bibitem{Val82}

\by S.~S.~Vallander

\paper Occupation times for countable Markov chains. I.~Chains with discrete time.

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

\serial Zap. Nauchn. Sem. LOMI

\yr 1982

\vol 119

\pages 39--61

\publ "Nauka", Leningrad. Otdel.

\publaddr Leningrad

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

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

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

Linking options:

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

https://www.mathnet.ru/eng/znsl/v119/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:	140

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

Registration to the website

Logotypes