Papers › Connectivity of Growing Random Networks
Connectivity of Growing Random Networks
P. L. Krapivsky, S. Redner, F. Leyvraz
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A solution for the time- and age-dependent connectivity distribution of a growing random network is presented. The network is built by adding sites which link to earlier sites with a probability A_k which depends on the number of pre-existing links k to that site. For homogeneous connection kernels, A_k ~ k^gamma, different behaviors arise for gamma<1, gamma>1, and gamma=1. For gamma<1, the number of sites with k links, N_k, varies as stretched exponential. For gamma>1, a single site connects to nearly all other sites. In the borderline case A_k ~ k, the power law N_k ~k^{-nu} is found, where the exponent nu can be tuned to any value in the range 2<nu<infinity.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections