Combinatorial enumeration of groups, graphs, and chemical compounds
Combinatorial enumeration of groups, graphs, and chemical compounds
The random walk construction of uniform spanning trees and uniform labelled trees
SIAM Journal on Discrete Mathematics
Mellin transforms and asymptotics: harmonic sums
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Journal of Computational and Applied Mathematics
Some typical properties of large AND/OR Boolean formulas
Random Structures & Algorithms
Combinatorics, Probability and Computing
Analytic Combinatorics
The enumeration of trees by height and diameter
IBM Journal of Research and Development
The CRT is the scaling limit of unordered binary trees
Random Structures & Algorithms
The degree profile of random Pólya trees
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees (“Otter trees”), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size n is proved to admit a limiting theta distribution, both in a central and local sense, and obey moderate as well as large deviations estimates. The approximations obtained for height also yield the limiting distribution of the diameter of unrooted trees. The proofs rely on a precise analysis, in the complex plane and near singularities, of generating functions associated with trees of bounded height. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012 (Supported by French ANR Project BOOLE; ANR-09-BLAN-0011.)