|
Fundamentalnaya i Prikladnaya Matematika, 1996, Volume 2, Issue 4, Pages 1029–1043
(Mi fpm197)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Research Papers Dedicated to the Memory of B. V. Gnedenko
Transient dynamics of two interacting random strings
A. A. Zamyatin, A. A. Yambartsev M. V. Lomonosov Moscow State University
Abstract:
A finite string is just a sequence of symbols from finite alphabet. We consider a Markov chain with the state space equal to the set of all pairs of strings. Transition probabilities depend only on $d$ leftmost symbols in each string. Besides that, the jumps of the chain are bounded: the lengths of strings at subsequent moments of time cannot differ by more than some $d$. We consider the case when dynamics of Markov chain is transient, i.e. as $t\to\infty$ the lengths of both strings tend to infinity with probability 1. In this situation we prove stabilization law: the distribution of symbols close to left ends of strings tends to those of some random process.
Received: 01.03.1996
Citation:
A. A. Zamyatin, A. A. Yambartsev, “Transient dynamics of two interacting random strings”, Fundam. Prikl. Mat., 2:4 (1996), 1029–1043
Linking options:
https://www.mathnet.ru/eng/fpm197 https://www.mathnet.ru/eng/fpm/v2/i4/p1029
|
Statistics & downloads: |
Abstract page: | 256 | Full-text PDF : | 95 | First page: | 2 |
|