|
This article is cited in 4 scientific papers (total in 4 papers)
Short Communications
On the longest head-run in an individual random sequence
V. V. V'yugin Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
In the framework of the Kolmogorov approach to verifying the theory of probability an analysis of a result of S. S. Samarova on the length of the longest head-run for the Markov chain with two states is given. This result is a refinement and generalization of P. Erdös and P. Revesz's corresponding results. An analogous assertion is formulated and proved for individual random sequences. A complexity characterization of its application is also given.
Keywords:
laws of large numbers, Markov chain, length of runs, individual random sequence, Kolmogorov complexity.
Received: 17.03.1997
Citation:
V. V. V'yugin, “On the longest head-run in an individual random sequence”, Teor. Veroyatnost. i Primenen., 42:3 (1997), 608–615; Theory Probab. Appl., 42:3 (1998), 541–546
Linking options:
https://www.mathnet.ru/eng/tvp2003https://doi.org/10.4213/tvp2003 https://www.mathnet.ru/eng/tvp/v42/i3/p608
|
|