title: Connectivity of growing random networks.
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 A(k) which depends on the number of preexisting links k to that site. For homogeneous connection kernels, A(k) approximately 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 a stretched exponential. For gamma>1, a single site connects to nearly all other sites. In the borderline case A(k) approximately k, the power law N(k) approximately k(-nu) is found, where the exponent nu can be tuned to any value in the range 2<nu<infinity.
authors.affiliation: Center for BioDynamics, Center for Polymer Studies, and Department of Physics, Boston University, Boston, Massachusetts 02215, USA.
authors.forename: P L
authors.initials: PL
authors.lastname: Krapivsky
authors.forename: S
authors.initials: S
authors.lastname: Redner
authors.forename: F
authors.initials: F
authors.lastname: Leyvraz
mesh_terms: D000465:Algorithms; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D011336:Probability