Average distance in growing trees

Simple item page
dc.creatorMalarz, K.
dc.creatorCzaplicki, J.
dc.creatorKawecka-Magiera, B.
dc.creatorKulakowski, K.
dc.date2003-04-28
dc.date.accessioned2026-07-07T02:51:02Z
dc.date.available2026-07-07T02:51:02Z
dc.descriptionTwo kinds of evolving trees are considered here: the exponential trees, where subsequent nodes are linked to old nodes without any preference, and the Barabási--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 $m=1$ nodes. Average node-node distance $d$ is calculated numerically in evolving trees as dependent on the number of nodes $N$. The results for $N$ not less than a thousand are averaged over a thousand of growing trees. The results on the mean node-node distance $d$ for large $N$ can be approximated by $d=2\ln(N)+c_1$ for the exponential trees, and $d=\ln(N)+c_2$ for the scale-free trees, where the $c_i$ are constant. We derive also iterative equations for $d$ and its dispersion for the exponential trees. The simulation and the analytical approach give the same results.
dc.description6 pages, 3 figures, Int. J. Mod. Phys. C14 (2003) - in print
dc.identifierhttps://arxiv.org/abs/cond-mat/0304636
dc.identifierhttp://arxiv.org/abs/cond-mat/0304636
dc.identifierInt. J. Mod. Phys. C14 (2003) 1201
dc.identifierdoi:10.1142/S0129183103005315
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/21310
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.titleAverage distance in growing trees
dc.typetext

Files

Collections

arXiv