Poisson Approximation for the Non-Overlapping Appearances of Several Words in Markov Chains
From MaRDI portal
Publication:2757073
DOI10.1017/S096354830100476XzbMath0994.62005MaRDI QIDQ2757073
Eutichia Vaggelatou, Stavros G. Papastavridis, Ourania Chryssaphinou
Publication date: 8 October 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Combinatorial probability (60C05) Approximations to statistical distributions (nonasymptotic) (62E17)
Related Items
Compound Poisson approximation: A user's guide ⋮ Waiting times for clumps of patterns and for structured motifs in random sequences ⋮ Some results associated with the longest run in a strongly ergodic Markov chain ⋮ On the length of the longest run in a multi-state Markov chain. ⋮ COMPOUND POISSON APPROXIMATION OF THE NUMBER DISTRIBUTION FOR MONOTONE STRINGS OF FIXED LENGTH IN A RANDOM SEQUENCE ⋮ A Compound Poisson Approximation Inequality ⋮ Poisson approximation ⋮ Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain
