247 research outputs found
Average distance in growing trees
Two kinds of evolving trees are considered here: the exponential trees, where
subsequent nodes are linked to old nodes without any preference, and the
Barab\'asi--Albert scale-free networks, where the probability of linking to a
node is proportional to the number of its pre-existing links. In both cases,
new nodes are linked to nodes. Average node-node distance is
calculated numerically in evolving trees as dependent on the number of nodes
. The results for not less than a thousand are averaged over a thousand
of growing trees. The results on the mean node-node distance for large
can be approximated by for the exponential trees, and
for the scale-free trees, where the are constant. We
derive also iterative equations for and its dispersion for the exponential
trees. The simulation and the analytical approach give the same results.Comment: 6 pages, 3 figures, Int. J. Mod. Phys. C14 (2003) - in prin
Guidelines for the authors
Publication of English-language versions of the volumes of the yearly Studia Ceranea. Journal of the Waldemar Ceran Research Centre for the History and Culture of the Mediterranean Area and South-East Europe financed through contract no. 501/1/P-DUN/2017 from the funds of the Ministry of Science and Higher Education devoted to the promotion of scholarship
Abbreviations
Publication of English-language versions of the volumes of the yearly Studia Ceranea. Journal of the Waldemar Ceran Research Centre for the History and Culture of the Mediterranean Area and South-East Europe financed through contract no. 501/1/P-DUN/2017 from the funds of the Ministry of Science and Higher Education devoted to the promotion of scholarship
- …