Expected degree of finite preferential attachment networks

2014/06/30 by Small, Michael
#Adaptation and Self-Organizing Systems (nlin.AO) #FOS: Computer and information sciences #FOS: Physical sciences #Social and Information Networks (cs.SI)

paper · doi:10.48550/arxiv.1407.0343

Abstract

We provide an analytic expression for the quantity described in the title. Namely, we perform a preferential attachment growth process to generate a scale-free network. At each stage we add a new node with m new links. Let k denote the degree of a node, and N the number of nodes in the network. The degree distribution is assumed to converge to a power-law (for k≥ m) of the form k^-γ and we obtain an exact implicit relationship for γ, m and N. We verify this with numerical calculations over several orders of magnitude. Although this expression is exact, it provides only an implicit expression for γ(m). Nonetheless, we provide a reasonable guess as to the form of this curve and perform curve fitting to estimate the parameters of that curve --- demonstrating excellent agreement between numerical fit, theory, and simulation.

Related

• Learning growth mechanisms of tail realistic preferential attachment models from network degree distributions
• Preferential attachment: a multi-attribute growth process generating\n scale-free networks of different topologies
• Networks with Growth and Preferential Attachment: Modeling and Applications
• Structural Properties of the Geometric Preferential Attachment Model
• Preferential attachment alone is not sufficient to generate scale free random networks