Translator Disclaimer
February 2020 Central limit theorems for patterns in multiset permutations and set partitions
Valentin Féray
Ann. Appl. Probab. 30(1): 287-323 (February 2020). DOI: 10.1214/19-AAP1502

Abstract

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.

Citation

Download Citation

Valentin Féray. "Central limit theorems for patterns in multiset permutations and set partitions." Ann. Appl. Probab. 30 (1) 287 - 323, February 2020. https://doi.org/10.1214/19-AAP1502

Information

Received: 1 November 2018; Revised: 1 May 2019; Published: February 2020
First available in Project Euclid: 25 February 2020

zbMATH: 07200529
MathSciNet: MR4068312
Digital Object Identifier: 10.1214/19-AAP1502

Subjects:
Primary: 05A05, 05A18, 60C05, 60F05

Rights: Copyright © 2020 Institute of Mathematical Statistics

JOURNAL ARTICLE
37 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.30 • No. 1 • February 2020
Back to Top