Asymptotic normality of pattern counts in random maps II

Abstract

In a recent work, a central limit theorem for pattern counts in random planar maps was proven by reducing the problem to a face count problem. We provide a shorter proof by circumventing this reduction through the computation of bivariate coefficient asymptotics from a functional equation with one catalytic variable and extend the result to pattern counts with arbitrary boundary and new map classes.