Asymptotic normality of pattern occurrences in random maps
Abstract
The purpose of this paper is to study the limiting distribution of special additive functionals on random planar maps, namely the number of occurrences of a given pattern. The main result is a central limit theorem for these pattern counts in the case of pattern with a simple boundary. The proof relies on a combination of analytic and combinatorial methods together with a moment method due to Gao and Wormald~GaoWormald. It is an important issue to handle the overlap structure of two pattern which is the main difficulty in the proof.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.