Memory effect in growing trees
arXiv:cond-mat/0304693 · doi:10.1016/j.physa.2004.07.026
Abstract
We show that the structure of a growing tree preserves an information on the shape of an initial graph. For the exponential trees, evidence of this kind of memory is provided by means of the iterative equations, derived for the moments of the node-node distance distribution. Numerical calculations confirm the result and allow to extend the conclusion to the Barabasi--Albert scale-free trees. The memory effect almost disappears, if subsequent nodes are connected to the network with more than one link.
9 pages, 9 figures
References in corpus (10)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Evolution of networks
- Statistical ensemble of scale-free random graphs
- Shortest paths and load scaling in scale-free trees
- Metric structure of random networks
- Tree Networks with Causal Structure
- Exact results and scaling properties of small-world networks
- Average distance in growing trees