|
This article is cited in 2 scientific papers (total in 2 papers)
Probability theory and mathematical statistics
On the number of characters matchings in discrete random sequence controlled by Markov chain
N. M. Mezhennaya Bauman Moscow State Technical University, ul. Baumanskaya 2-ya, 5/1,
105005, Moscow, Russia
Abstract:
The present paper is devoted to studying the properties of the number of pairs of characters matchings in discrete random sequence controlled by Markov chain with finite number of states. Alongside with the random variable we also consider the number of characters which appears in a random sequence exactly $k$ times, $k=0,1,2$. We derive the estimators for total variation distance between distributions of the considered random variables and Poisson distribution. This results allow to develop Poisson and normal limit theorems.
Keywords:
pairs of characters matchings, placing of particles, Poisson limit theorem, normal limit theorem.
Received January 27, 2016, published May 6, 2016
Citation:
N. M. Mezhennaya, “On the number of characters matchings in discrete random sequence controlled by Markov chain”, Sib. Èlektron. Mat. Izv., 13 (2016), 305–317
Linking options:
https://www.mathnet.ru/eng/semr674 https://www.mathnet.ru/eng/semr/v13/p305
|
Statistics & downloads: |
Abstract page: | 217 | Full-text PDF : | 52 | References: | 39 |
|