Abstract

The Horton laws originated in hydrology with a 1945 paper by Robert E. Horton, and for a long time remained a purely empirical finding. Ubiquitous in hierarchical branching systems, the Horton laws have been rediscovered in many disciplines ranging from geomorphology to genetics to computer science. Attempts to build a mathematical foundation behind the Horton laws during the 1990s revealed their close connection to the operation of pruning – erasing a tree from the leaves down to the root. This survey synthesizes recent results on invariances and self-similarities of tree measures under various forms of pruning. We argue that pruning is an indispensable instrument for describing branching structures and representing a variety of coalescent and annihilation dynamics. The Horton laws appear as a characteristic imprint of self-similarity, which settles some questions prompted by geophysical data.

Highlights

  • Invariance of the critical binary Galton-Watson tree measure with respect to pruning that begins at the leaves and progresses down to the tree root has been recognized since the late 1980s

  • We show (Cor. 21 of Thm. 28) that the shock tree is isometric to the level set tree of the initial potential, and the model evolution is equivalent to a generalized dynamical pruning of the shock tree, with the pruning function equal to the total tree length (Thm. 30)

  • We introduce here a class of hierarchical branching processes that enjoy all of the symmetries discussed in this work – Horton self-similarity, criticality, timeinvariance, strong Horton law, Tokunaga self-similarity, and have independently distributed edge lengths

Read more

Summary

Introduction

Invariance of the critical binary Galton-Watson tree measure with respect to pruning (erasure) that begins at the leaves and progresses down to the tree root has been recognized since the late 1980s. Both continuous [123] and discrete [34] versions of prunings have been studied. The prune-invariance of the trees naturally translates to the symmetries of the respective Harris paths [80] The richness of such a connection is supported by the well-studied embeddings of the Galton-Watson trees in the excursions of random walks and Brownian motions We keep references to a minimum, and indicate survey sections where one can find future information

Early empirical evidence: self-similar river networks
Survey structure
Spaces of finite rooted trees
Real trees
Horton pruning
Horton-Strahler orders
Alternative definitions of Horton-Strahler orders
Tokunaga indices and side branching
Labeling edges
Galton-Watson trees
Self-similarity with respect to Horton pruning
Self-similarity of a combinatorial tree
Self-similarity of a tree with edge lengths
Mean self-similarity of a combinatorial tree
Examples of self-similar trees
Horton law in self-similar trees
Proof of Theorem 1
Well-defined asymptotic Horton ratios
Entropy and information theory
Applications
Hydrology
Computer science
Critical binary Galton-Watson tree
Combinatorial case
Self-similarity and attraction properties
The Central Limit Theorem and strong Horton law
Metric case: exponential edge lengths
Self-similarity
Tree length
Tree height
Invariant Galton-Watson trees
Hierarchical branching process
Definition and main properties
Hydrodynamic limit
Definitions
Criticality and time invariance in a self-similar process
Closed form solution for equally distributed branch lengths
Critical Tokunaga process
Martingale approach
Markov tree process
Martingale representation of tree size and length
Strong Horton laws in a critical Tokunaga tree
Combinatorial HBP: geometric branching process
Tokunaga self-similarity of time invariant process
Frequency of orders in a large critical Tokunaga tree
Proof of Theorem 17
Tree representation of continuous functions
Harris path
Level set tree
Tamed functions: finite number of local extrema
General case
Reciprocity of Harris path and level set tree
Horton pruning of positive excursions
Excursion of a symmetric random walk
Exponential random walks
Geometric random walks and critical non-binary Galton-Watson trees
White noise and Kingman’s coalescent
White noise
Level set trees on higher dimensional manifolds and Morse theory
Kingman’s coalescent process
Smoluchowski-Horton ODEs for Kingman’s coalescent
Some properties of the Smoluchowski-Horton system of ODEs
Simplifying the Smoluchowski-Horton system of ODEs
Proof of the existence of the root-Horton limit
Proof of Lemma 28 and related results
10. Generalized dynamical pruning
10.1.1. Example: pruning via the tree height
10.1.2. Example: pruning via the Horton-Strahler order
10.1.3. Example: pruning via the total tree length
10.1.4. Example: pruning via the number of leaves
10.2. Pruning for R-trees
10.3. Relation to other generalizations of pruning
10.4. Invariance with respect to the generalized dynamical pruning
11. Continuum 1-D ballistic annihilation
11.2. Piece-wise linear potential with unit slopes
11.2.1. Graphical representation of the shock wave tree
11.2.2. Structure of the shock wave tree
11.2.3. Ballistic annihilation as generalized pruning
11.3. Ballistic annihilation of an exponential excursion
11.4. Random sink in an infinite exponential potential
11.5. Real tree description of ballistic annihilation
11.5.1. R-tree representation of ballistic annihilation
11.5.2. Metric spaces on the set of initial particles
11.5.3. Other prunings on T
12. Infinite trees built from leaves down
12.1. Infinite plane trees built from the leaves down
12.3. Continuum annihilation
13. Some open problems
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call