Patterns and pattern-matching in trees: an analysis
Information and Control
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Discrete Applied Mathematics
Asymptotic distributions and a multivariate Darboux method in enumeration problems
Journal of Combinatorial Theory Series A
Systems of functional equations
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Patterns in random binary search trees
Random Structures & Algorithms
On the Analysis of Tree-Matching Algorithms
Proceedings of the 7th Colloquium on Automata, Languages and Programming
The distribution of nodes of given degree in random trees
Journal of Graph Theory
Analytic Combinatorics
The degree profile of random Pólya trees
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
Let 𝒯n denote the set of unrootedlabelled trees of size n and let m be aparticular (finite, unlabelled) tree. Assuming that every tree of𝒯n is equally likely, it is shown thatthe limiting distribution as n goes to infinity of thenumber of occurrences of m is asymptotically normalwith mean value and variance asymptotically equivalent toμn and σ2n, respectively, wherethe constants μ0 and σ≥0 are computable.