|
|||||
|
|
A stabilization law for two semi-infinite interacting strings of characters |
|
| Authors: | |
| Institution: | (1) Instituto de Matemática e Estatística, Universidade de São Paulo, Rua do Matão 1010, 05508-900 São Paulo, SP, BRASIL;(2) Laboratory of Large Random Systems, Faculty of Mechanics and Mathematics, Moscow State University, 119899 Moscow, RUSSIA |
| Abstract: | We consider a Markov chain that describes the evolution of two interacting strings of symbols. The transitions probalitities of this Markov chain depend only on the rightmost symbols of both strings. The main goal of the present paper is to prove a limit theorem (stabilization law): the distribution of the rightmost symbols converges to some limit correlation function.1 Partially supported by FAPESP (2002/01501-9) and RFBR (02-01-00415)2 Partially supported by RFBR (02-01-00415) |
| Keywords: | Markov chain stabilization law string of character |
| 本文献已被 SpringerLink 等数据库收录！ | |