Papers › Evolution of reference networks with aging
Evolution of reference networks with aging
S. N. Dorogovtsev, J. F. F. Mendes
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.
We study the growth of a reference network with aging of sites defined in the following way. Each new site of the network is connected to some old site with probability proportional (i) to the connectivity of the old site as in the Barab\'{a}si-Albert's model and (ii) to τ^(-α), where τ is the age of the old site. We consider α of any sign although reasonable values are 0 ≤α≤∞. We find both from simulation and analytically that the network shows scaling behavior only in the region α< 1. When α increases from -∞ to 0, the exponent γ of the distribution of connectivities (P(k) ∝k^(-γ) for large k) grows from 2 to the value for the network without aging, i.e. to 3 for the Barab\'{a}si-Albert's model. The following increase of α to 1 makes γ to grow to ∞. For α>1 the distribution P(k) is exponentional, and the network has a chain structure.
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