RUS  ENG
Full version
JOURNALS // Matematicheskie Zametki // Archive

Mat. Zametki, 1969 Volume 6, Issue 5, Pages 555–566 (Mi mzm6963)

This article is cited in 3 papers

Invariant random boolean fields

Yu. K. Belyaev, Yu. I. Gromak, V. A. Malyshev

M. V. Lomonosov Moscow State University

Abstract: In the set of finite binary sequences a Markov process is defined with discrete time in which each symbol of the binary sequence at time $t+1$ depends on the two neighboring symbols at time $t$. A proof is given of the existence and uniqueness of an invariant distribution, and its derivation is also given in a number of cases.

UDC: 519.2

Received: 19.01.1968


 English version:
Mathematical Notes, 1969, 6:5, 792–799

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024