The distribution of subword counts is usually normal

DOI10.1006/EUJC.1993.1030zbMATH Open0776.68097OpenAlexW2034145759MaRDI QIDQ685313FDOQ685313

Authors: Edward A. Bender, Fred Kochman 

Publication date: 10 November 1993

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1993.1030

Recommendations

• The statistics of words on rings
• A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials
• Spectral analysis of word statistics
• STACS 2004
• Error bounds on multivariate Normal approximations for word count statistics

zbMATH Keywords

Markov chainsruns count statistics

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorics on words (68R15)

Cited In (13)

• Multiple pattern matching: a Markov chain approach
• Error bounds on multivariate Normal approximations for word count statistics
• Variances and covariances in the central limit theorem for the output of a transducer
• A unified approach to word occurrence probabilities
• On the number of occurrences of a symbol in words of regular languages.
• Approximation of sojourn-times via maximal couplings: motif frequency distributions
• Hidden words statistics for large patterns
• Motif statistics.
• Successions in words and compositions
• Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations
• Stochastic analysis of minimal automata growth for generalized strings
• Spectral analysis of word statistics
• A survey of temporal data mining

This page was built for publication: The distribution of subword counts is usually normal

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