# Numbers of n-th neighbors and node-to-node distances in growing networks

Source: [Numbers of n-th neighbors and node-to-node distances in growing networks](<https://www.sota2.com/research/paper/68fa20297a2b558e2932f173>)

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

Data updated: 2025-10-23T21:02:26.782Z

Authors: K. Malarz

Published: 2005-07-06T13:15:44.000Z

## Abstract

Topology of exponential and scale-free trees and simple graphs is investigated numerically. The numbers of the nearest neighbors, the next-nearest neighbors, the next-next-nearest neighbors, the 4-th and the 5-th neighbors are calculated. The functional dependence of the node-to-node distance d\_{ij} on the product of connectivities k\_ik\_j has been also checked. The results of simulations for exponential networks agree with the existing analytical predictions.

## 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/0507127>)

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