Answers are grounded in this paper and cite their sources.
A solution for the time- and age-dependent connectivity distribution of a growing random network is presented. The network is built by adding sites that link to earlier sites with a probability Aₖ which depends on the number of preexisting links k to that site. For homogeneous connection kernels, Aₖ~k^γ, different behaviors arise for γ<1, γ>1, and γ0ex0ex=0ex0ex1. For γ<1, the number of sites with k links, Nₖ, varies as a stretched exponential. For γ>1, a single site connects to nearly all other sites. In the borderline case Aₖ~k, the power law Nₖ~k^-ν is found, where the exponent ν can be tuned to any value in the range 2<ν<∞.
No takes yet. Share an insight, caveat, or question.
Krapivsky et al. (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: