Entropy and Hausdorff Dimension in Random Growing Trees

We investigate the limiting behavior of random tree growth in preferential attachment models. The tree stems from a root, and we add vertices to the system one-by-one at random, according to a rule which depends on the degree distribution of the already existing tree. The so-called weight function,...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Rudas, Anna, Imre Péter Tóth
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 08.06.2011
Subjects
Apexes
Attachment
Constraining
Mathematics - Probability
Trees (mathematics)
Weighting functions
Online AccessGet full text

Cover

More Information
Summary:We investigate the limiting behavior of random tree growth in preferential attachment models. The tree stems from a root, and we add vertices to the system one-by-one at random, according to a rule which depends on the degree distribution of the already existing tree. The so-called weight function, in terms of which the rule of attachment is formulated, is such that each vertex in the tree can have at most K children. We define the concept of a certain random measure mu on the leaves of the limiting tree, which captures a global property of the tree growth in a natural way. We prove that the Hausdorff and the packing dimension of this limiting measure is equal and constant with probability one. Moreover, the local dimension of mu equals the Hausdorff dimension at mu-almost every point. We give an explicit formula for the dimension, given the rule of attachment.
ISSN:2331-8422
DOI:10.48550/arxiv.1004.0977