Abstract
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 which depends on the number of preexisting links to that site. For homogeneous connection kernels, , different behaviors arise for , , and . For , the number of sites with links, , varies as a stretched exponential. For , a single site connects to nearly all other sites. In the borderline case , the power law is found, where the exponent can be tuned to any value in the range .
- Received 8 May 2000
DOI:https://doi.org/10.1103/PhysRevLett.85.4629
©2000 American Physical Society