Local Limits for String of Frozen Characters

Author(s)

Logachov, V, A. ; Mogulsky, A. A. ^{[1, 2]} ; Prokopenko, I, E. ; Yambartsev, A. A. ^[3]

Affiliation

^[1] Logachov, A., V, I, Russian Acad Sci, Sobolev Inst Math, Lab Probabil Theory & Math Stat, Siberian Branch, Koptuga 4, Novosibirsk 630090 - Russia

^[2] Logachov, A., V, I, Novosibirsk State Univ, Pirogova Str 1, Novosibirsk 630090 - Russia

^[3] Univ Sao Paulo, Inst Math & Stat, Dept Stat, Rua Matao 1010, BR-05508090 Sao Paulo, SP - Brazil

• Document type: Journal article
• Source: Markov Processes and Related Fields; v. 26, n. 5, p. 885-899, 2020.
• Web of Science Citations: 0

Abstract

The model we study belongs to a wide class of Markov processes called strings of characters. The model consists of a transient random walk on integers which write and re-write letters (characters) from some finite alphabet on its location. We apply the precise asymptotic theorems established for compound semi-Markov renewal process (CSRP) to study the asymptotics of the statistics of frozen characters, that is the characters on the integers that never will be visited again after some (increasing) time. (AU)

• FAPESP's process: 17/10555-0 - Stochastic modeling of interacting systems
• Grantee: Fabio Prates Machado
• Support Opportunities: Research Projects - Thematic Grants