Topological self-similarity on the random binary-tree model

DOI10.1007/S10955-010-9928-5MaRDI QIDQ967662zbMATH OpenOpenAlexFDO

Authors Ken Yamamoto, Yoshihiro Yamazaki

Publication date 30 April 2010

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0910.4795

zbMATH Keywords

asymptotic behaviorbinary treebranching patternhierarchical structureHorton-Strahler analysistopological self-similarity

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Self-similar stochastic processes (60G18)

Abstract: Asymptotic analysis on some statistical properties of the random binary-tree model is developed. We quantify a hierarchical structure of branching patterns based on the Horton-Strahler analysis. We introduce a transformation of a binary tree, and derive a recursive equation about branch orders. As an application of the analysis, topological self-similarity and its generalization is proved in an asymptotic sense. Also, some important examples are presented.

Recommendations

• Horton-Strahler ordering of random binary trees
• Tree asymmetry -- a sensitive and practical measure for binary topological trees
• Inevitable self-similar topology of binary trees and their diverse hierarchical density
• Topological properties of binary trees grown with order-dependent branching probabilities
• Large deviation theorem for branches of the random binary tree in the Horton-Strahler analysis

Cites work

• Central limit theorem for the bifurcation ratio of a random binary tree
• Horton-Strahler ordering of random binary trees
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• On Horton's Law for Random Channel Networks
• On the Average Shape of Binary Trees
• On the Order of Random Channel Networks

Cited in

(10)

• Topological properties of binary trees grown with order-dependent branching probabilities
• Reductions of binary trees and lattice paths induced by the register function
• Random self-similar trees and a hierarchical branching process
• Tokunaga and Horton self-similarity for level set trees of Markov chains
• GENERAL CODING METHOD ON RANDOM SELF-SIMILAR TREE COMPOSED OF MULTIPLE BASIC PATTERNS
• Central limit theorem for the Horton-Strahler bifurcation ratio of general branch order
• Large deviation theorem for branches of the random binary tree in the Horton-Strahler analysis
• Toward a quantification of self-similarity in plants
• Precise deviations for branches of the random binary tree in the Horton-Strahler analysis
• Inevitable self-similar topology of binary trees and their diverse hierarchical density

This page was built for publication: Topological self-similarity on the random binary-tree model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967662)