Finite size effects in Barabasi-Albert growing networks

Abstract

We investigate the influence of the network's size on the degree distribution in Barabasi-Albert model of growing network with initial attractiveness. Our approach based on spectral moments allows to treat analytically several variants of the model and to calculate the cut-off function giving finite size corrections to the degree distribution. We study the effect of initial configuration as well as of addition more than one link per time step. The results indicate that asymptotic properties of the cut-off depend only on the exponent in the power law describing the tail of the degree distribution.

arXiv comment10 pages, 3 figures

References in corpus (22)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Epidemic spreading in scale-free networks
• The spread of epidemic disease on networks
• Evolution of networks
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Connectivity of Growing Random Networks
• Organization of Growing Random Networks
• The statistical mechanics of networks
• Absence of epidemic threshold in scale-free networks with connectivity correlations
• Cut-offs and finite size effects in scale-free networks
• Generic scale of the "scale-free" growing networks
• Statistical ensemble of scale-free random graphs
• Correlated random networks
• Finiteness and Fluctuations in Growing Networks
• Sampling properties of random graphs: the degree distribution
• Uncorrelated Random Networks
• Principles of statistical mechanics of random networks
• Organization of complex networks without multiple connections
• Correlations in Scale-Free Networks: Tomography and Percolation
• Designer Nets from Local Strategies
• Memory effect in growing trees

Cited by in corpus (10)

• Critical phenomena in complex networks
• Two universal physical principles shape the power-law statistics of real-world networks
• Sampling from naturally truncated power laws: The matchmaking paradox
• Dynamic scaling, data-collapse and self-similarity in Barabási-Albert networks
• Power laws in zero-range processes on random networks
• Maximal modularity and the optimal size of parliaments
• Finite-time fluctuations in the degree statistics of growing networks
• A measure for characterizing heavy-tailed networks
• Approaching the thermodynamic limit in equilibrated scale-free networks
• Simple rules govern finite-size effects in scale-free networks