This is the authors' abstract. We don't add key points for this paper.
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 labeled 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 analyzing the behavior of sufficiently high factorial moments.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Ojeda et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: