On the probability of existence of substrings with the same structure in a random sequence

DOI10.1515/DMA-2017-0038zbMath1397.60099OpenAlexW2773945574MaRDI QIDQ1744334

Vladimir G. Mikhailov

Publication date: 23 April 2018

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2017-0038

zbMATH Keywords

Markov chainpolynomial schemeequivalent substringsstructure of substring

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items (3)

Limit distributions of extremal distances to the nearest neighbor ⋮ On coincidences of tuples in a \(q\)-ary tree with random labels of vertices ⋮ On the reduction property of the number of \(H\)-equivalent tuples of states in a discrete Markov chain

Cites Work

• Unnamed Item
• Unnamed Item
• On repetitions of long tuples in a Markov chain
• Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain
• Compound Poisson approximation for multiple runs in a Markov chain
• On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence
• Matchings up to permutations in sequences of independent trials
• Structural equivalence of s-tuples in random discrete sequences
• О числах множеств эквивалентных цепочек в последовательности независимых случайных величин
• Многократные повторения длинных цепочек в конечной цепи Маркова

This page was built for publication: On the probability of existence of substrings with the same structure in a random sequence