Compound Poisson approximations for word patterns under Markovian hypotheses

DOI10.2307/3215201zbMath0843.60025OpenAlexW2326525345MaRDI QIDQ4866762

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

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

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

Related Items (16)

Compound Poisson approximation: A user's guide ⋮ Signed Poisson approximations for Markov chains ⋮ Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains. ⋮ Compound Poisson approximation ⋮ String matching and 1d lattice gases ⋮ Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source ⋮ Malliavin calculus for marked binomial processes and applications ⋮ Distribution of patterns of constrained length in binary sequences ⋮ ESTIMATOR FOR THE DISTRIBUTION OF THE NUMBERS OF RUNS IN A RANDOM SEQUENCE CONTROLLED BY STATIONARY MARKOV CHAIN ⋮ Approximation for counts of head runs ⋮ On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source ⋮ A Compound Poisson Approximation Inequality ⋮ A unified approach to word occurrence probabilities ⋮ Compound Poisson approximation of word counts in DNA sequences ⋮ The distributions of the frequency of occurrence of nucleotide subsequences ⋮ On binomial and circular binomial distributions of order \(k\) for \(l\)-overlapping success runs of length \(k\)

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