Fringe trees for random trees with given vertex degrees

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given vertex degrees, for random simply generated trees (or conditioned Galton--Watson trees), and for additive functionals. The key tool for our work is an extension to the multivariate setting of a theorem by Gao and Wormald (2004), which provides a way to show asymptotic normality by analysing the behaviour of sufficiently high factorial moments.