Improved Poisson approximations for word patterns

DOI10.2307/1427656MaRDI QIDQ5286948zbMATH OpenOpenAlexFDO

Authors Anant P. Godbole, Andrew A. Schaffner

Publication date 11 October 1993

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

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

zbMATH Keywords

Stein-Chen methodcouplingsPoisson approximationsnon-overlapping and overlapping occurrences of word patternsrates of convergence to stationarity

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)

Recommendations

• Compound Poisson approximations for word patterns under Markovian hypotheses
• Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain
• Poisson approximation for the non-overlapping appearances of several words in Markov chains
• A unified approach to word occurrence probabilities
• Poisson evolution in word selection
• Poisson approximation for search of rare words in DNA sequences

Cited in

(20)

• Poisson approximation for (k₁, k₂)-events via the Stein-Chen method
• Explicit distributional results in pattern formation
• Exact and asymptotic results for pattern waiting times
• Poisson approximation for the non-overlapping appearances of several words in Markov chains
• Approximate probabilities for runs and patterns in i.i.d. and Markov-dependent multistate trials
• Compound Poisson approximations for word patterns under Markovian hypotheses
• Error bounds on multivariate Normal approximations for word count statistics
• A Compound Poisson Model for Word Occurrences in DNA Sequences
• On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials
• Compound Poisson approximation: A user's guide
• Compound Poisson approximation of word counts in DNA sequences
• The statistics of words on rings
• Poisson approximation for the number of non-decreasing runs in Markov chains
• Pseudo-binomial approximation to \((k_1, k_2)\)-runs
• EXPONENTIAL RECURRENCE DISTRIBUTION IN THE SIMON-YULE MODEL OF TEXT
• Approximating the distributions of runs and patterns
• Approximations related to the sums of \(m\)-dependent random variables
• On occurrences of \(F-S\) strings in linearly and circularly ordered binary sequences
• On the number of appearances of a word in a sequence of i. i. d. trials
• On the number of characters matchings in discrete random sequence controlled by Markov chain

This page was built for publication: Improved Poisson approximations for word patterns

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