# Average distance in growing trees

Source: [Average distance in growing trees](<https://www.sota2.com/research/paper/68fa1e457a2b558e293214b1>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-23T14:39:44.514Z

Authors: K.Malarz, J.Czaplicki, B.Kawecka-Magiera, K.Kulakowski

Published: 2003-04-28T15:08:31.000Z

## Abstract

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 $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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/cond-mat/0304636>)

[PDF](<https://arxiv.org/pdf/cond-mat/0304636.pdf>)
