Random self-similar trees and a hierarchical branching process
Yevgeniy Kovchegov, Ilya Zaliapin

TL;DR
This paper explores self-similarity in random binary trees, extending classical models to include edge lengths and hierarchical processes, revealing phase transitions and critical processes with rich symmetries.
Contribution
It introduces a broad class of hierarchical branching processes with various self-similarity properties, including mean and edge-length self-similarity, and analyzes their phase transitions and critical cases.
Findings
Construction of self-similar hierarchical branching processes.
Identification of a phase transition between fading and explosive behavior.
Description of critical Tokunaga processes with additional symmetries.
Abstract
We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts the tree leaves. This only happens for the critical Galton-Watson tree (a constant process progeny), which also exhibits other special symmetries. We extend the prune-invariance setup to arbitrary binary trees with edge lengths. In this general case the class of self-similar processes becomes much richer and covers a variety of practically important situations. The main result is construction of the hierarchical branching processes that satisfy various self-similarity definitions (including mean self-similarity and self-similarity in edge-lengths) depending on the process parameters. Taking the limit of averaged stochastic dynamics, as the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
