Asymptotic normality for $m$-dependent and constrained $U$-statistics, with applications to pattern matching in random strings and permutations
Probability
2022-03-10 v3 Combinatorics
Abstract
We study (asymmetric) -statistics based on a stationary sequence of -dependent variables; moreover, we consider constrained -statistics, where the defining multiple sum only includes terms satisfying some restrictions on the gaps between indices. Results include a law of large numbers and a central limit theorem. Special attention is paid to degenerate cases where, after the standard normalization, the asymptotic variance vanishes; in these cases non-normal limits occur after a different normalization. The results are motivated by applications to pattern matching in random strings and permutations. We obtain both new results and new proofs of old results.
Cite
@article{arxiv.2106.09401,
title = {Asymptotic normality for $m$-dependent and constrained $U$-statistics, with applications to pattern matching in random strings and permutations},
author = {Svante Janson},
journal= {arXiv preprint arXiv:2106.09401},
year = {2022}
}
Comments
53 pages. v3 considerably extended