Average distance in growing trees

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 3 figures, Int. J. Mod. Phys. C14 (2003) - in print

Scientific paper

10.1142/S0129183103005315

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Average distance in growing trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Average distance in growing trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average distance in growing trees will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-44918

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.