We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and in set partitions. This generalizes results for patterns of size 2 in both settings, obtained by Canfield, Janson and Zeilberger and Chern, Diaconis, Kane and Rhoades, respectively.
No takes yet. Share an insight, caveat, or question.
A 2020 study studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: