Asymptotics of Tree Families and Simple Varieties of Trees
Anchor (Master): Flajolet-Sedgewick 2009 *Analytic Combinatorics* (Cambridge) Ch. VI.7-VII.4 and Ch. VII.6 (singularities of inverse functions, the smooth implicit-function schema, simple varieties of trees, the height and width / Airy profile, and the Drmota-Lalley-Woods theorem for positive algebraic systems); Drmota 2009 *Random Trees* (Springer) Ch. 3-4 and Ch. 8 (the systems theorem, the Brownian-excursion / continuum-random-tree limit); Meir-Moon 1978 *On the altitude of nodes in random trees* (Canad. J. Math.) for the $\sqrt{\pi n}$ height law
Intuition Beginner
A tree family is a single recipe for building trees: a root carries some number of smaller trees of the same kind, and a fixed rule says how many children a node may have. Plain branching trees allow any number of children; binary trees allow zero or two; Motzkin trees allow zero, one, or two. Each rule produces its own family, and each family has its own count of trees of a given size. This unit asks one question about every such family at once: as the trees grow large, how does the count grow?
The headline is a surprise. The growth rate — the base raised to the power — changes from family to family. But a second, finer factor in the count does not change: every one of these families carries the same correction over times the square root of , written . Plain trees, binary trees, labelled trees, Motzkin trees: different bases, the same tail. This shared factor is the universal tree-counting law, and it is the main character of the unit.
Why should families this different agree on anything? The reason is a kind of self-similarity. Because each tree is a root carrying smaller copies of the same object, the recipe folds back on itself, and that folding has the same shape no matter what the child rule is. Almost all large trees in a family look alike at scale — they share one typical silhouette — and that common silhouette is what forces the common law.
Visual Beginner
Picture the count of size- trees plotted against for three families on the same chart. Each curve climbs roughly like its own base to the power — a steep exponential — so on a plain chart the three curves race off at different rates and you learn nothing more. The shared structure is hidden underneath the exponential.
Now strip each curve of its own exponential by dividing the count by that family's base raised to . The three rescaled curves stop racing and settle onto one common shape, a slow decay that behaves like . That collapse is the picture of universality: once you remove the family-specific growth base, what remains is the same for everybody.
| tree family | child rule | growth base | shared tail |
|---|---|---|---|
| plain (general) trees | any number of children | ||
| binary trees | or children | ||
| Motzkin trees | , , or children | ||
| labelled (Cayley) trees | any, children unordered |
The base depends on the rule; the tail does not. A reader who remembers only one thing should remember that last column.
Worked example Beginner
Let us watch the universal tail appear in the most familiar family: plain branching trees, counted by the Catalan numbers. The number of plain trees with edges is . We will check that for large this behaves like a constant times times .
Step 1. Write out a few Catalan numbers: , , , , , , , .
Step 2. Pull out the growth base. Divide each by : for , ; for , ; for , . The numbers shrink, so the base slightly overshoots — there is a decaying correction left over.
Step 3. Identify the correction. Multiply what is left by times the square root of , that is by : for , ; for , . These level off near a constant, about .
Step 4. Compare with the predicted constant. The clean prediction is , and ; the slow drift of our numbers toward roughly and on up is consistent with that limit (the approach is gradual). The base and the tail are exactly what the universal law predicts.
What this tells us: a family-specific base ( for plain trees) sets the exponential, and once you remove it the leftover is the universal shape — the same tail every simple tree family carries.
Check your understanding Beginner
Formal definition Intermediate+
A simple variety of trees (equivalently a simply generated family) is fixed by a degree-generating function with and nonnegative coefficients, not reducing to . Its counting generating function is the unique formal power series with solving the implicit equation
$$
y(z) = z,\phi\big(y(z)\big).
$$
Combinatorially weights a node with subtrees, and the equation reads "a tree is a root carrying a -weighted sequence (or set) of subtrees," the catalytic recursion of 40.01.07. Plane trees take (any number of ordered children); binary trees ; unary-binary (Motzkin) trees ; labelled (Cayley) trees , giving the tree function of 40.01.07.
The structural object is the inverse function. Since , the relation inverts near the origin to
$$
z = \psi(y) := \frac{y}{\phi(y)}, \qquad \psi(0) = 0,\ \psi'(0) = \frac{1}{\phi(0)} \ne 0,
$$
so is the compositional inverse of , analytic where stays nonzero. The characteristic value is the smallest positive solution, inside the disc of convergence of , of
$$
\psi'(\tau) = 0 \iff \phi(\tau) - \tau,\phi'(\tau) = 0 \iff \frac{\tau,\phi'(\tau)}{\phi(\tau)} = 1,
$$
and the dominant singularity of sits at . The notation , for the principal branch, (dominant-singularity modulus), and (characteristic value) is recorded in _meta/NOTATION.md.
Counterexamples to common slips Intermediate+
"Any gives a square-root singularity." The characteristic equation must have a positive root inside the disc of convergence of , with (the smooth, or "irreducible-quadratic", case). For the root is ; for a polynomial of degree a root exists. Linear (paths) has no such root — there is no branching, hence no square root.
"The singularity is a pole, as in the meromorphic case." It is an algebraic branch point of square-root type, not a pole: stays finite at , equal to , but its derivative blows up. The residue calculus of
40.08.03does not apply; the square-root transfer of the companion singularity-analysis unit does." is where blows up." Generally radius of . The singularity is created by the inversion failing (), not by itself becoming singular. For (entire), comes purely from .
"Periodicity never intrudes." If for some (e.g. only even child-counts allowed), then has singularities on and the coefficients vanish off a residue class; the law then holds along the supported class. Aperiodicity ( of supported degrees ) restores a unique dominant singularity.
Key theorem with proof Intermediate+
The signature theorem is the square-root singularity and universal law for a simple variety of trees: the inverse-function schema forces an algebraic branch point of exponent , and the singularity-analysis transfer reads off the universal subexponential factor [Flajolet-Sedgewick Ch. VII.3].
Theorem (singular expansion and tree asymptotics). Let have nonnegative coefficients, , be aperiodic, and admit a positive root of inside its disc of convergence, with . Let . Then defined by is analytic in , has its unique dominant singularity at , and admits the singular expansion $$ y(z) = \tau - c\sqrt{1 - z/\rho} + O!\big(1 - z/\rho\big), \qquad c = \sqrt{\frac{2,\phi(\tau)}{\phi''(\tau)}}. $$ Consequently, by the square-root transfer , $$ [z^n],y(z) ;\sim; \frac{c}{2\sqrt\pi};\rho^{-n},n^{-3/2} ;=; \sqrt{\frac{\phi(\tau)}{2\pi,\phi''(\tau)}};\rho^{-n},n^{-3/2}. $$
Proof. Set , so and . Compute
$$
\psi'(y) = \frac{\phi(y) - y\phi'(y)}{\phi(y)^2},
$$
which vanishes exactly when ; by hypothesis the least positive such in the disc of convergence of is , and . Because has nonnegative coefficients, is increasing on (there ), so is real-analytic and increasing for , rising to ; the inverse exists and is analytic wherever , hence on . The point is the dominant singularity: obstructs analytic inversion there, and aperiodicity (with Pringsheim's theorem of 40.08.03 forcing a positive-axis singularity for the nonnegative-coefficient series ) makes it the unique singularity of modulus .
Near expand to second order. Since , $$ z = \psi(y) = \psi(\tau) + \tfrac12\psi''(\tau)(y - \tau)^2 + O!\big((y-\tau)^3\big) = \rho + \tfrac12\psi''(\tau)(y-\tau)^2 + \cdots . $$ A direct computation from gives at the characteristic value (the first-derivative terms cancel because ). Solving the quadratic relation for , $$ (y - \tau)^2 = \frac{2(z - \rho)}{\psi''(\tau)} = \frac{-2\rho,(1 - z/\rho)}{\psi''(\tau)}, \qquad y - \tau = -\sqrt{\frac{2\rho}{\psi''(\tau)}};\sqrt{1 - z/\rho}, $$ the negative branch chosen because increases to from below as . Substituting and gives , so , establishing the singular expansion. Higher-order terms in the Taylor expansion of produce the remainder. The transfer with and gives ; the constant contributes nothing past and the remainder contributes , so .
Corollary (general plane / Catalan case). For , the equation is , giving , , , and , so and , matching the Catalan asymptotic after the edge/node index shift.
Bridge. This theorem is the foundational reason every simple variety of trees obeys one universal law: the family-specific data enters only through the two numbers (the growth base) and (the amplitude), while the exponent is fixed by the square-root type of the singularity, which the inverse-function schema produces for every branching family. This is exactly the second principle of 40.08.03 — singularity type fixes the subexponential factor — instantiated with an algebraic branch point in place of a pole; the meromorphic of 40.08.03 is replaced by because replaces . The construction builds toward the height and profile theory of the Advanced results, where the same that fix and reappear as the variance scaling the height law, and it appears again in the Drmota-Lalley-Woods theorem, where a whole positive system shares one square-root singularity. The central insight is that the singularity of comes from the inversion , not from , so it generalises the Lagrange-inversion residue form of 40.01.07: Lagrange inversion gives the exact coefficient , and differentiating the singularity of the inverse is what turns that exact form into the asymptotic. Putting these together, the exact enumeration of 40.01.07 and the asymptotic law here are the algebraic and analytic faces of the same fixed-point equation .
Exercises Intermediate+
Advanced results Master
Beyond the singular expansion, the theory of simple varieties extends to the height and width laws governed by the Airy / Brownian-excursion limit, to the additive-functional transfer, and to the universality of the square-root singularity across positive polynomial systems.
Theorem 1 (universal singular expansion, restated with error terms). Under the hypotheses of the Key theorem, admits a full singular expansion in powers of : $$ y(z) = \tau - c_1(1 - z/\rho)^{1/2} + c_2(1 - z/\rho) - c_3(1 - z/\rho)^{3/2} + \cdots, \quad c_1 = \sqrt{\tfrac{2\phi(\tau)}{\phi''(\tau)}}, $$ convergent in a -domain (a slit disc) about , so that singularity-analysis transfer yields a complete asymptotic expansion , the odd half-integer powers of supplying the visible scale and the integer powers contributing nothing past constants [Flajolet-Sedgewick Ch. VII.3].
Theorem 2 (height of random trees, law). Let be the height of a uniformly random tree of size in a simple variety with offspring variance (the variance of the size-biased offspring law attached to ). Then $$ \mathbb{E}[H_n] \sim \sqrt{\frac{\pi}{\sigma^2}};\sqrt{n} = \sqrt{\pi n}\cdot\sigma^{-1}, \qquad \frac{H_n}{\sqrt{n}} \xrightarrow{d} \sigma^{-1}\max_{0\le t\le 1} \mathbf{e}(t), $$ where is the standard Brownian excursion; the limit law of is the theta distribution -type expansion, with all moments expressible through the Airy function. The plane-tree () value is [Meir-Moon 1978, Flajolet-Sedgewick Ch. VII.10].
Theorem 3 (width and the profile process). Let count nodes at depth in a random size- tree of the variety. The rescaled profile converges, as a process in , to , the local time at level of the normalised Brownian excursion; consequently the width with a constant expressible through the Airy distribution, and the total path length (sum of depths) is of order with an Airy-distributed limit law. These are the continuum-random-tree (Aldous CRT) readings of the same square-root singularity [Drmota 2009 Ch. 4].
Theorem 4 (additive functionals and the transfer). For an additive functional with toll of subtree-generating function , the expected value over random size- trees transfers through the same square-root singularity: if has a singular contribution , then acquires growth governed by relative to the of . Tolls with analytic at give (linear, additive over a typical fringe), while critical tolls (e.g. subtree-size sums) push the order to , matching the path-length scale of Theorem 3 [Flajolet-Sedgewick Ch. VII.4].
Theorem 5 (Drmota-Lalley-Woods, positive systems). Let solve a polynomial system with having nonnegative coefficients, that is proper (, no summing to identity), strongly connected (the dependency digraph among the is strongly connected), and aperiodic. Then all components share a common dominant singularity , each has a square-root singular expansion , and consequently $$ [z^n],y_j(z) ;\sim; \frac{c_j}{2\sqrt\pi},\rho^{-n},n^{-3/2} $$ for every , with determined by the vanishing of the Jacobian determinant at the characteristic point. The single-equation tree theorem is the case ; the systems theorem extends the universal law to context-free specifications, families of mutually recursive trees, and many maps and lattice-path classes [Flajolet-Sedgewick Ch. VII.6, Drmota 2009 Ch. 8].
Synthesis. The universal law is the foundational reason "simple variety of trees" is a single asymptotic phenomenon rather than a list of cases: every branching family is an inverse-function schema , the inversion fails at the characteristic point , and a smooth stationary point is generically quadratic, so the inverse is a square root and the transfer reads off regardless of . The central insight is that the family enters only through and the amplitude , while the exponent is locked by the singularity type — this is exactly the second principle of 40.08.03, now with an algebraic branch point in place of a pole, and it is dual to the meromorphic case where the type is a pole and the factor is the integer-power .
Putting these together, the same that fix the count's amplitude fix the offspring variance , so the height law, the Brownian-excursion profile, and the Airy path-length distribution all read off the same local data as the coefficient asymptotic; the bridge is that the singular expansion's coefficient and the limit-process's scaling are two extractions from one second-order Taylor expansion of . This generalises the Lagrange-inversion exact form of 40.01.07 — which gives exactly — into its asymptotic shadow, and the Drmota-Lalley-Woods theorem generalises the single to an entire strongly connected positive system sharing one square-root singularity, so the universality is not an accident of one equation but the structural fact of positive algebraic systems: a strongly connected branching mechanism has exactly one critical point, and its smoothness forces the square root.
Full proof set Master
Proposition 1 (existence and location of the characteristic value). Let have nonnegative coefficients, , for some , and radius of convergence . Then is continuous and strictly increasing on with ; if as (or ), there is a unique with , equivalently .
Proof. On , and (positive coefficients, nonconstant), so is well-defined and positive. Write , the mean of the random variable with . Its derivative is (a standard exponential-family computation: is the mean of a tilted law and its -derivative is the variance over ), so strictly increases. As the law concentrates on , so . By the intermediate value theorem, has a unique solution precisely when the limit . Then .
Proposition 2 (square-root singular expansion). At from Proposition 1 with , the inverse satisfies as , with and .
Proof. Since is analytic at with , , the Weierstrass/Morse normal form gives an analytic change of variable: there is , analytic and invertible near , with . Hence and ; inverting gives . For real with from below, , and , so is imaginary; choosing the branch that keeps real and increasing yields . The constant is ; by Proposition 3 below , and .
Proposition 3 ( at the characteristic value). , so .
Proof. From , differentiate: . At , annihilates the second term, leaving . Since for a branching family, and its magnitude is as stated.
Proposition 4 (coefficient asymptotic via transfer). With , , analytic in a -domain at , .
Proof. The singularity-analysis transfer theorem (companion unit) states that a function analytic in a -domain at with , , has . Apply with , : and give . The constant term contributes only to , and the remainder has , contributing , subleading. Linearity gives . The -domain analyticity required by the transfer holds because , the inverse of analytic with an isolated at , continues analytically to a slit neighbourhood of (the only obstruction is the branch point at itself), and aperiodicity rules out other singularities of modulus .
Proposition 5 (height first moment, sketch within the schema). For the simple variety with and offspring variance , .
Proof sketch. The bivariate generating function of trees of height satisfies the truncated recursion , , a sequence of approximants converging to from below. The tail probability is controlled by the difference , whose dominant singularity analysis near shows -profile. Summing the tail, , and the limit integrand is the tail of , whose mean is ; combined with the excursion normalisation this yields . The rigorous limit law is the theta/Airy distribution of Theorem 2 [Meir-Moon 1978, Flajolet-Sedgewick Ch. VII.10].
Connections Master
This unit is the asymptotic completion of the exact tree enumeration of
40.01.07: there the tree function and the general fixed-point were solved by Lagrange-Bürmann inversion to give , and here the same equation is read analytically — the inverse has , producing the square-root singularity that turns the exact coefficient into the law. The Catalan and Cayley instances computed there (, ) reappear here as the , and the , specialisations.The transfer engine is supplied by the companion singularity-analysis unit
40.08.04, co-produced this wave: it proves the Hankel-contour theorem and the -domain transfer that this unit invokes at . Where40.08.04owns the general algebraic-logarithmic transfer machinery, this unit is its flagship application: the inverse-function schema is the canonical source of the square-root singularity , and the universal tree law is the headline consequence of40.08.04's transfer.The unit sits in the analytic-combinatorics pipeline alongside the meromorphic theory of
40.08.03: there the dominant singularity is a pole and the subexponential factor is the integer power ; here it is an algebraic branch point and the factor is . The two are the two halves of the second principle (singularity type fixes the subexponential factor), and the remaining case — entire generating functions with no finite singularity, where growth is read from a saddle point — is handled by40.08.06, so the three units partition the asymptotic regimes of combinatorial generating functions.The square-root universality generalises beyond single trees to positive algebraic systems via the Drmota-Lalley-Woods theorem of the Advanced results, connecting forward to context-free specifications and to map enumeration: planar maps, dissections, and pattern-avoiding lattice-path families all satisfy strongly connected positive systems and inherit the (or, at non-smooth critical points, other algebraic) exponents. The Brownian-excursion / continuum-random-tree limit links this unit to probability theory, where Aldous's CRT is the scaling limit common to every simple variety, and the offspring-variance constant ties the analytic amplitude to the probabilistic Galton-Watson conditioning.
Historical & philosophical context Master
The recognition that diverse tree families share one asymptotic shape emerged from George Pólya's 1937 enumeration of chemical isomers and rooted trees, which produced the functional equations and the first asymptotic estimates, and from the singularity-based coefficient asymptotics that Edward Bender (1974), Asymptotic methods in enumeration (SIAM Review 16, 485–515), systematised for implicitly defined generating functions. The explicit "simple families of trees" framework and the height law are due to Amram Meir and John Moon (1978) [Meir-Moon 1978], who computed node-altitude moments through the inverse-function singularity and named the class.
The square-root singularity of the inverse function and the universal coefficient law were placed inside the singularity-analysis transfer framework by Philippe Flajolet and Andrew Odlyzko (1990), Singularity analysis of generating functions (SIAM J. Discrete Math. 3, 216–240), and organised as the smooth implicit-function schema in Flajolet and Sedgewick's Analytic Combinatorics (2009) [Flajolet-Sedgewick Ch. VII], whose Chapter VII makes the inverse-function singularity, the height/profile Airy laws, and the Drmota-Lalley-Woods systems theorem a single development. The probabilistic counterpart — that a Galton-Watson tree conditioned on size converges after scaling to the continuum random tree — is David Aldous's (1991–1993) CRT, and the systems universality is the Drmota (1997), Lalley (1993), Woods (1997) theorem, consolidated in Michael Drmota's Random Trees (2009) [Drmota 2009]. The Brownian-excursion height law traces to Daniel Renyi and George Szekeres (1967) for plane trees and Flajolet-Odlyzko (1982) for the general height distribution.
Bibliography Master
@book{flajoletsedgewick2009,
author = {Flajolet, Philippe and Sedgewick, Robert},
title = {Analytic Combinatorics},
publisher = {Cambridge University Press},
year = {2009}
}
@book{drmota2009randomtrees,
author = {Drmota, Michael},
title = {Random Trees: An Interplay between Combinatorics and Probability},
publisher = {Springer},
year = {2009}
}
@article{meirmoon1978altitude,
author = {Meir, A. and Moon, J. W.},
title = {On the altitude of nodes in random trees},
journal = {Canadian Journal of Mathematics},
volume = {30},
year = {1978},
pages = {997--1015}
}
@article{flajoletodlyzko1990singularity,
author = {Flajolet, Philippe and Odlyzko, Andrew},
title = {Singularity analysis of generating functions},
journal = {SIAM Journal on Discrete Mathematics},
volume = {3},
number = {2},
year = {1990},
pages = {216--240}
}
@article{bender1974asymptotic,
author = {Bender, Edward A.},
title = {Asymptotic methods in enumeration},
journal = {SIAM Review},
volume = {16},
number = {4},
year = {1974},
pages = {485--515}
}
@article{aldous1991crt,
author = {Aldous, David},
title = {The continuum random tree. I},
journal = {The Annals of Probability},
volume = {19},
number = {1},
year = {1991},
pages = {1--28}
}
@article{drmota1997systems,
author = {Drmota, Michael},
title = {Systems of functional equations},
journal = {Random Structures \& Algorithms},
volume = {10},
number = {1-2},
year = {1997},
pages = {103--124}
}