Graduate Thesis Or Dissertation


Information Theoretical Analysis of Self-Similar Trees Public Deposited

Downloadable Content

Download PDF


Attribute NameValues
  • Tree-like patterns are ubiquitous in nature. Botanical trees, river networks, and blood systems are the most well-known examples of complex hierarchical systems met in observations. Interestingly, many of such systems exhibit statistical self-similarity. There are two main types of self-similarity: Horton self-similarity and Tokunaga self-similarity. Although there is an increased attention to the topic of trees' self-similarity, there is still a lack of theory that would allow to measure the information content embodied in vast variety of complex self-similar systems. In this work, we address the question of information quantification in tree-like self-similar structures. We start with combinatorial results that provide cardinality of several subspaces of binary trees with given structural characteristics. Then, using the notions of entropy we study the structural complexity of uniformly distributed binary trees. Furthermore, we consider classes of Horton self-similar and Tokunaga self-similar uniformly distributed trees and, using the notion of entropy rate, analyze how the structural complexity of such trees changes as the number of vertices of the tree grows to infinity.
Resource Type
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Committee Member
  • Evgenia V. Chunikhina "Information Theoretical Analysis of Self-Similar Trees" (PhD thesis)
Academic Affiliation
Rights Statement
Peer Reviewed



This work has no parents.

In Collection: