On the probability of existence of substrings with the same structure in a random sequence
-
Vladimir G. Mikhailov
Abstract
An asymptotic expression (with an explicit estimate of the remainder term) is obtained for the probability that in a finite sequence of polynomial trials controlled by a Markov chain there exist substrings having the same structure.
Originally published in Diskretnaya Matematika (2016) 28, №1, 97–110 (in Russian).
Funding source: Russian Science Foundation
Award Identifier / Grant number: 14-50-00005
Funding statement: This work was supported by the Russian Science Foundation under grant no. 14-50-00005
Acknowledgment
The author is grateful to A. M. Zubkov for useful comments.
References
[1] Buravlev S. M., “Matchings up to permutations in sequences of independent trials”, Discrete Math. Appl., 9:1 (1999), 53–78.10.1515/dma.1999.9.1.53Search in Google Scholar
[2] Mikhailov V. G., Shoitov A. M., “Structural equivalence of s-tuples in random discrete sequences”, Discrete Math. Appl., 13:6 (2003), 541–568.10.1515/156939203322733273Search in Google Scholar
[3] Mikhailov V. G., “On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence”, Discrete Math. Appl., 18:6 (2008), 563–568.10.1515/DMA.2008.042Search in Google Scholar
[4] Mikhailov V. G., Shoitov A. M., “On the numbers of equivalent tuples sets in a sequence of independent random variables”, Matematicheskie voprosy kriptografii, 4:1 (2013), 77–86 (in Russian).10.4213/mvk74Search in Google Scholar
[5] Elliott R. J., Aggoun L., Moore J. B., Hidden Markov Models, N.-Y.: Springer-Verlag, 1995.Search in Google Scholar
[6] Barbour A. D., Holst L., Janson S., Poisson Approximation, Oxford University Press, Oxford, 1992.10.1093/oso/9780198522355.001.0001Search in Google Scholar
[7] ChryssaphinouO., Vaggelatou E., “Compound Poisson approximation for multiple runs in a Markov chain”, Ann. Inst. Statist. Math., 54:2 (2002), 411–424.10.1023/A:1022438422611Search in Google Scholar
[8] Mikhailov V. G., Shoitov A. M., “On repetitions of long tuples in a Markov chain”, Discrete Math. Appl., 25:5 (2015), 295–303.10.1515/dma-2015-0028Search in Google Scholar
[9] Mikhailov V. G., Shoitov A. M., “On multiple repetitions of long tuples in a Markov chain”, Matematicheskie voprosy kriptografii, 6:3 (2015), 117–134 (in Russian).10.4213/mvk163Search in Google Scholar
[10] Mikhailov V. G., “Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain”, Discrete Math. Appl., 26:2 (2016), 105–113.10.1515/dma-2016-0008Search in Google Scholar
© 2017 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- Estimating the level of affinity of a quadratic form
- Cyclic decomposition of sets, set-splitting digraphs and cyclic classes of risk-free games
- Large deviations of branching processes with immigration in random environment
- On the probability of existence of substrings with the same structure in a random sequence
- Linearly realizable automata
- On the number of labeled outerplanar k-cycle blocks
- Convergence of the sequence of the Pearson statistics values to the normalized square of the Bessel process
Articles in the same Issue
- Frontmatter
- Estimating the level of affinity of a quadratic form
- Cyclic decomposition of sets, set-splitting digraphs and cyclic classes of risk-free games
- Large deviations of branching processes with immigration in random environment
- On the probability of existence of substrings with the same structure in a random sequence
- Linearly realizable automata
- On the number of labeled outerplanar k-cycle blocks
- Convergence of the sequence of the Pearson statistics values to the normalized square of the Bessel process
