Horton–Strahler Number (HS)

• HS is an integer invariant that measures a tree’s branching complexity via a recursive rule based on child node orders.
• Its formulation underpins various fields such as hydrology, analytic combinatorics, and formal-language theory through pruning dynamics and Tokunaga statistics.
• Algorithmic implementations enable efficient computation on compressed trees, with complexities classified from NC¹ to P-complete depending on the tree representation.

The Horton–Strahler number (HS), also called the Strahler number or the register function, is an integer-valued invariant of a rooted tree that measures branching complexity rather than mere depth. In its standard recursive form, a node inherits the maximum order of its children unless that maximum is attained by at least two children, in which case the order increases by one; in complementary formulations, HS is characterized by pruning dynamics or by the largest complete or perfect binary tree embeddable in the given tree (Kovchegov et al., 2015, Addario-Berry et al., 2024, Daviaud et al., 2020). Across the literature, HS serves as a canonical coordinate for hierarchical branching in hydrology, random-tree asymptotics, analytic combinatorics, compressed-tree algorithms, formal-language theory, parity games, planar reticular networks, and empirical studies of sentence structure (Brandenberger et al., 2020, Ganardi et al., 2015, Mileyko et al., 2011).

1. Core definitions and equivalent characterizations

For rooted directed binary trees, the most common convention assigns order $1$ to leaves and then defines the order of an internal node $v$ with children $ch_1(v),ch_2(v)$ by

$$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$

and otherwise

$S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$

The HS number of the tree is the value at the root, and this bottom-up computation is unique (Tanaka-Ishii et al., 2023). In full binary-tree settings the same rule is often written

$k(p)=\max(i,j)+\delta_{ij},$

where $i$ and $j$ are the orders of the two children and $\delta_{ij}$ is the Kronecker delta (Kovchegov et al., 2015).

A second convention, standard in the register-function literature, assigns value $0$ to a leaf. For a binary tree $v$0 with subtrees $v$1,

$v$2

This is the same invariant up to a shift in indexing convention (Hackl et al., 2016). A similar $v$3-based formulation is used for ranked trees in compressed-representation settings, where internal nodes are evaluated by taking the maximum child value and incrementing iff that maximum is not unique (Ganardi et al., 2015).

Several papers emphasize equivalent structural interpretations. For a rooted tree $v$4, the Horton–Strahler number is the height of the tallest complete binary tree that can be homeomorphically embedded in $v$5, with the embedding required to preserve ancestral structure, lexicographic order, and most recent common ancestors (Addario-Berry et al., 2024). In ordered rooted trees, the Strahler number is also described as the largest height of a perfect binary tree that is a minor of the tree (Daviaud et al., 2020). In pruning-based treatments of full binary trees, the order of a vertex $v$6 and its parental edge is the minimal number of prunings needed to eliminate the subtree rooted at $v$7: $v$8 This makes pruning an intrinsic dynamical interpretation of HS (Kovchegov et al., 2015).

The notion extends naturally from vertices to branches. In self-similar-tree and random-binary-tree analyses, a branch of order $v$9 is a maximal connected path, or maximal connected sequence, of nodes or vertices and parental edges all having order $ch_1(v),ch_2(v)$0 (Yamamoto, 2019, Kovchegov et al., 2015). This branch-centric perspective underlies Horton laws, Tokunaga statistics, and branch-count asymptotics.

2. Pruning dynamics, Tokunaga structure, and Horton laws

In finite rooted full binary trees, pruning $ch_1(v),ch_2(v)$1 is defined by cutting all leaves and their parental edges and then removing the resulting chains of degree-two vertices by series reduction. A basic structural fact is that pruning decreases the Horton–Strahler order of every vertex and branch by unity. At the branch-count level,

$ch_1(v),ch_2(v)$2

and for side branches,

$ch_1(v),ch_2(v)$3

This order shift is the mechanism that makes pruning the natural dynamics behind self-similarity (Kovchegov et al., 2015).

For a probability measure $ch_1(v),ch_2(v)$4 on the set $ch_1(v),ch_2(v)$5 of full binary trees of order $ch_1(v),ch_2(v)$6, the expected number of order-$ch_1(v),ch_2(v)$7 branches is

$ch_1(v),ch_2(v)$8

and the expected number of order-$ch_1(v),ch_2(v)$9 branches that merge order-$$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$0 branches is

$$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$1

The Tokunaga coefficients are then

$$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$2

measuring the expected number of order-$$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$3 side branches attached to a typical order-$$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$4 branch (Kovchegov et al., 2015).

A tree ensemble is called coordinated when $$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$5 does not depend on $$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$6, and mean self-similar when the coefficients depend only on order difference: $$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$7 In this form, self-similarity is pruning invariance of the expected side-branching statistics. The strong Horton law is the asymptotic geometric decay

$$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$8

for every fixed $$S(v)=S(ch_1(v))+1 \quad \text{if } S(ch_1(v))=S(ch_2(v)),$$9, equivalently $S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$0 (Kovchegov et al., 2015).

A central theorem identifies the exact condition under which the strong Horton law holds for self-similar trees: $S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$1 is necessary and sufficient. When this condition holds, the Horton exponent is determined by the unique real root $S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$2 of

$S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$3

through

$S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$4

The expected Horton numbers satisfy the recursion

$S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$5

which is the mean counterpart of deterministic branch-count equations used in earlier Horton-law work (Kovchegov et al., 2015).

This self-similar viewpoint has an information-theoretic analogue. For planted binary plane trees satisfying Horton law with exponent $S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$6, the entropy rate is

$S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$7

where $S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$8 is the binary entropy function. In that model, $S(v)=\max\big(S(ch_1(v)),S(ch_2(v))\big).$9, $k(p)=\max(i,j)+\delta_{ij},$0, and $k(p)=\max(i,j)+\delta_{ij},$1, so the Horton exponent directly constrains asymptotic structural complexity (Chunikhina, 2018).

3. Enumerative combinatorics, reductions, and refined variants

Classical analytic combinatorics links HS to Dyck-path height. If $k(p)=\max(i,j)+\delta_{ij},$2 denotes full binary trees with $k(p)=\max(i,j)+\delta_{ij},$3 internal vertices and Horton–Strahler number $k(p)=\max(i,j)+\delta_{ij},$4, and $k(p)=\max(i,j)+\delta_{ij},$5 denotes Dyck paths of length $k(p)=\max(i,j)+\delta_{ij},$6 whose height $k(p)=\max(i,j)+\delta_{ij},$7 satisfies

$k(p)=\max(i,j)+\delta_{ij},$8

then

$k(p)=\max(i,j)+\delta_{ij},$9

Equivalently, the HS class $i$0 corresponds to Dyck-path heights in the interval

$i$1

Thus the classical HS statistic records a logarithmic bin of Dyck-path height rather than the exact height itself (Addario-Berry et al., 2024).

A recent refinement resolves this logarithmic collapse. An increasing sequence of trees $i$2 interpolates the complete binary trees, with $i$3. The refined Horton–Strahler number is

$i$4

The main refined theorem states that if $i$5 is the set of full binary trees with $i$6 internal vertices and $i$7, and $i$8 is the set of Dyck paths of length $i$9 and exact height $j$0, then

$j$1

The classical HS number is recovered by grouping refined values in the range

$j$2

This refinement makes exact Dyck height, rather than only $j$3, visible on the tree side (Addario-Berry et al., 2024).

A complementary combinatorial interpretation comes from reduction theory. For binary trees, a reduction $j$4 deletes all leaves and then repeatedly merges nodes with exactly one child until no such node remains. The register function satisfies

$j$5

and therefore

$j$6

In this formulation, HS is exactly the maximal number of reductions that can be applied before the tree collapses to a single leaf (Hackl et al., 2016).

This reduction viewpoint also induces a natural family of substructures. An $j$7-branch is a maximal chain of nodes labeled $j$8, and for uniformly random binary trees with $j$9 internal nodes the expected number $\delta_{ij}$0 of $\delta_{ij}$1-branches satisfies

$\delta_{ij}$2

while the variance begins with

$\delta_{ij}$3

The leading factor $\delta_{ij}$4 exhibits the same geometric rarity of higher-order structure that appears in Horton laws (Hackl et al., 2016).

Explicit fixed-level generating functions are available in several tree classes. For binary trees and weighted unary-binary trees, a substitution such as

$\delta_{ij}$5

yields closed forms for the generating functions $\delta_{ij}$6 of trees with Horton–Strahler number exactly $\delta_{ij}$7. In those families, the average HS is logarithmic, with main term $\delta_{ij}$8 and a tiny periodic fluctuation arising from dyadic singular structure (Prodinger, 2021).

4. Random-tree asymptotics and fluctuation theory

For critical Galton–Watson trees with finite variance conditioned on total size $\delta_{ij}$9, the HS number grows logarithmically: $0$0 Equivalently, $0$1. The proof combines local convergence to Kesten’s infinite tree for the lower bound with a rotationally invariant argument for the upper bound (Brandenberger et al., 2020).

This finite-variance result extends to critical Galton–Watson trees in the domain of attraction of an $0$2-stable law. For $0$3, under conditioning on size $0$4,

$0$5

The case $0$6 recovers the classical $0$7 behavior. The boundary case $0$8, the spectrally positive Cauchy regime, is not universal: the correct scale depends on the slowly varying tail through a function $0$9, and the paper gives explicit examples where the growth is of order $v$00 or $v$01 (Khanfir, 2023).

A real-valued regularization removes deterministic oscillations from the integer-valued statistic. In leaf-weighted trees, the weighted Horton–Strahler number is defined recursively so that its floor equals the classical HS number, and its fractional part is one of the leaf weights. For $v$02-weighted trees with leaf weights distributed as $v$03, where $v$04, the weighted HS number is exactly exponential with mean $v$05. Under size conditioning and rescaling, a suitable exponential transform of this quantity converges jointly with the tree itself to a measurable functional of the $v$06-stable Lévy tree, called the Strahler dilation; in the Brownian case $v$07, twice the Strahler dilation has the same law as the Brownian tree height (Khanfir, 2024).

For random planar full binary trees with $v$08 leaves, fixed-order branch counts satisfy both central-limit and large-deviation principles. If $v$09 denotes the number of branches of order $v$10, then for each fixed $v$11,

$v$12

and

$v$13

The corresponding large-deviation rate function is the Legendre transform of an iterated cumulant generator $v$14, with

$v$15

and the law concentrates near the Horton-law value $v$16 (Yamamoto, 2017, Yamamoto, 2019).

Other probabilistic tree models yield distinct HS regimes. For Kingman’s coalescent tree, asymptotic branch densities satisfy a Smoluchowski-type ODE system, and weak root-Horton self-similarity holds: $v$17 with numerical estimate $v$18 (Kovchegov et al., 2012). In uniform simple butterfly trees with $v$19 nodes,

$v$20

and a central limit theorem holds for the normalized HS. For general butterfly trees, a deterministic upper bound

$v$21

is sharp, and the paper reports empirical concentration near that upper support bound (Peca-Medlin, 14 Sep 2025).

5. Algorithmic, compression-theoretic, and complexity-theoretic roles

HS is algorithmically tractable on several compressed tree representations. For a ranked tree encoded by a string straight-line program over its preorder traversal, the Strahler number can be computed in polynomial time. The proof uses a general evaluation framework for SLP-compressed trees, reduction to caterpillar trees, and a Strahler-specific refinement that tracks the deepest one or two occurrences needed to detect whether the maximum child value is unique (Ganardi et al., 2015).

The representation of the tree is decisive for complexity. When a binary tree is given as a term, the problem “is $v$22?” is complete for uniform $v$23. With pointer representation, the same problem is $v$24-complete. For trees represented succinctly by a binary DAG or a tree straight-line program, the general problem is $v$25-complete. For fixed thresholds $v$26, finer classifications appear: for example, the term-representation problem is $v$27-complete for $v$28, the DAG case lies in $v$29, and the TSLP case is $v$30-complete for $v$31 (Ganardi et al., 22 Dec 2025).

Formal-language applications use HS as a bounded-branching parameter on derivation trees. In Chomsky normal form, derivation trees are binary after terminal leaves are removed, and if such a tree has height $v$32 and Horton–Strahler number $v$33, then it has at most $v$34 leaves and at most $v$35 nodes. This size bound motivates the class $v$36 of grammars whose acyclic derivation trees all have HS at most $v$37. For every fixed $v$38, the context-free membership problem for symmetric groups restricted to grammars from $v$39 is NP-complete, whereas the unrestricted context-free membership problem for symmetric groups is PSPACE-complete (Lohrey et al., 2022).

In parity games, the Strahler number is lifted from trees to attractor decompositions. The Strahler number of a game is defined from the smallest Strahler number of decomposition trees of the relevant dominions, and it coincides with both the progress-measure Strahler number and Lehtinen’s register number. If a parity game has Strahler number $v$40, then it can be solved in quasi-linear space and in time polynomial in the number of vertices $v$41 and linear in

$v$42

where $v$43 is the number of priorities. In particular, if

$v$44

then parity games are solvable in polynomial time (Daviaud et al., 2020).

6. Generalizations beyond rooted trees and empirical interpretations

Classical HS presupposes a tree structure and therefore fails on reticular networks with loops: cyclic dependencies prevent a consistent upstream-to-downstream ordering. For weighted planar reticular networks, one generalization orders loops and tree structure separately. Edges are sorted by increasing weight, every face starts with level $v$45, and when an edge separating two distinct faces $v$46 and $v$47 is removed, the merged face receives level

$v$48

while the removed edge gets

$v$49

The removed edges form a reticular hierarchy on the co-tree of faces, and the remaining edges form a spanning tree on which the classical Horton–Strahler scheme is applied (Mileyko et al., 2011).

This planar generalization preserves the logic of equal-level merging while separating loop-forming edges from tree edges. It also supports Tokunaga-style side-branching statistics for both the tree and the co-tree. The sensitivity analysis is asymmetric: a transposition of two reticular edges changes the loop hierarchy locally by at most one level, whereas a transposition involving a reticular edge and a tree edge can cause arbitrarily large changes in the tree hierarchy (Mileyko et al., 2011).

In empirical syntax, HS has been proposed as a branching-complexity measure for sentence trees and as a lower bound on memory needed for bottom-up or shift-reduce processing. For binary trees with $v$50 leaves, the upper limit is

$v$51

while the lower limit is $v$52 if $v$53 and $v$54 if $v$55. Dependency trees are first binarized, and upper and lower limits are computed over all binarizations (Tanaka-Ishii et al., 2023).

Using Universal Dependencies v2.8 across 202 corpora in 114 languages, the reported average HS values are about $v$56 under grammar-based binarization and $v$57 under a heuristic binarization based on modifier distance and left/right placement. The median is $v$58 for upper limits and $v$59 for grammar-based binarization, heuristic binarization, and lower limits; values above $v$60 are rare, the largest observed value is $v$61, and the smallest is $v$62. When random trees are sampled to match sentence-length distributions, the average HS is very close to the linguistic values, leading the paper to conclude that tree-size distribution, rather than language-specific structure, largely determines the observed range. In this setting, HS is interpreted as a rigorous lower bound on the number of stack spaces or memory areas needed for tree evaluation, connecting it to Sethi–Ullman-style register minimization and earlier psycholinguistic claims about $v$63 to $v$64 memory resources (Tanaka-Ishii et al., 2023).