Mass distribution exponents for growing trees
arXiv:cond-mat/0612412 · doi:10.1088/1742-5468/2007/02/P02011
Abstract
We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that measures the repartition of the mass of large trees between their different subtrees. This distribution is shown to be a broad distribution and we derive explicit expressions for scaling exponents that characterize its behavior when one subtree is much smaller than the others. We show in particular the existence of various regimes with different values of these mass distribution exponents. Our results are corroborated by a number of exact solutions for particular solvable cases, as well as by numerical simulations.
References in corpus (5)
- Statistical mechanics of complex networks
- Non-perturbative Lorentzian Quantum Gravity, Causality and Topology Change
- The spectral dimension of generic trees
- A functional limit theorem for the profile of search trees
- Critical and Multicritical Semi-Random (1+d)-Dimensional Lattices and Hard Objects in d Dimensions