Asymptotic Joint Normality of Counts of Uncorrelated Motifs in Recursive Trees

作者：Gopaladesikan Mohan^*; Mahmoud Hosam; Ward Mark Daniel

来源：Methodology and Computing in Applied Probability, 2014, 16(4): 863-884.

DOI：10.1007/s11009-013-9333-z

• Analysis of algorithms
• Random trees
• Recurrence
• Motif
• Contraction

We study the fringe of random recursive trees, by analyzing the joint distribution of the counts of uncorrelated motifs. Our approach allows for finite and countably infinite collections. To be able to deal with the collection when it is infinitely countable, we use measure-theoretic themes. Each member of a collection of motifs occurs a certain number of times on the fringe. We show that these numbers, under appropriate normalization, have a limiting joint multivariate normal distribution. We give a complete characterization of the asymptotic covariance matrix. The methods of proof include contraction in a metric space of distribution functions to a fixed-point solution (limit distribution). We discuss two examples: the finite collection of all possible motifs of size four, and the infinite collection of rooted stars. We conclude with remarks to compare fringe-analysis with matching motifs everywhere in the tree.

• 出版日期2014-12