Compound Poisson approximations for word patterns under Markovian hypotheses

DOI10.2307/3215201MaRDI QIDQ4866762zbMATH OpenOpenAlexFDO

Authors Mark X. Geske, Anant P. Godbole, Andrew A. Schaffner, Allison M. Skolnick, Garrick Wallstrom

Publication date 18 March 1996

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3215201

zbMATH Keywords

couplingPoisson and compound Poisson approximationStein-Chen technique

Mathematics Subject Classification ID

Combinatorial probability (60C05) Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Poisson approximation for the non-overlapping appearances of several words in Markov chains
• Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain
• Improved Poisson approximations for word patterns
• Compound Poisson approximation for multiple runs in a Markov chain
• Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain

Cited in

(27)

• A unified approach to word occurrence probabilities
• Signed Poisson approximations for Markov chains
• Compound Poisson approximation: A user's guide
• Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains.
• Compound Poisson approximation
• Doob-Martin compactification of a Markov chain for growing random words sequentially
• The distributions of the frequency of occurrence of nucleotide subsequences
• Malliavin calculus for marked binomial processes and applications
• Poisson approximation for the non-overlapping appearances of several words in Markov chains
• Statistical analysis of the number of self-overlapping leftmost repeats in an homogeneous stationary Markov chain on finite states
• On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source
• Compound Poisson approximation of word counts in DNA sequences
• The detection of words and an ordering for Markov chains
• Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain
• A Compound Poisson Model for Word Occurrences in DNA Sequences
• Joint distribution of pattern frequencies and multivariate Pólya-Aeppli law
• EXPONENTIAL RECURRENCE DISTRIBUTION IN THE SIMON-YULE MODEL OF TEXT
• Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source
• Error bounds on multivariate Normal approximations for word count statistics
• ESTIMATOR FOR THE DISTRIBUTION OF THE NUMBERS OF RUNS IN A RANDOM SEQUENCE CONTROLLED BY STATIONARY MARKOV CHAIN
• Improved Poisson approximations for word patterns
• Approximation for counts of head runs
• A Compound Poisson Approximation Inequality
• The statistics of words on rings
• Distribution of patterns of constrained length in binary sequences
• On binomial and circular binomial distributions of order k for l-overlapping success runs of length k
• String matching and 1d lattice gases

This page was built for publication: Compound Poisson approximations for word patterns under Markovian hypotheses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4866762)