On the number of appearances of a word in a sequence of i. i. d. trials
From MaRDI portal
Publication:1961835
DOI10.1023/A:1010042628865zbMATH Open0949.60014OpenAlexW42698946MaRDI QIDQ1961835FDOQ1961835
Authors: Ourania Chryssaphinou, Eutichia Vaggelatou, Stavros Papastavridis
Publication date: 3 December 2000
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1010042628865
Recommendations
- Improved Poisson approximations for word patterns
- 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
- scientific article; zbMATH DE number 939776
- Poisson approximations for runs and patterns of rare events
Cited In (8)
- Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain
- A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials
- Compound Poisson approximation: A user's guide
- Error bounds on multivariate Normal approximations for word count statistics
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
- Poisson approximation for the non-overlapping appearances of several words in Markov chains
- Title not available (Why is that?)
- The Lexicographic First Occurrence of a I-II-III pattern
This page was built for publication: On the number of appearances of a word in a sequence of i. i. d. trials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961835)