Volume 112, Number 6, December 2015
|Number of page(s)||6|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||08 January 2016|
Giant component sizes in scale-free networks with power-law degrees and cutoffs
Eindhoven University of Technology - Eindhoven, The Netherlands
Received: 27 November 2015
Accepted: 22 December 2015
Scale-free networks arise from power-law degree distributions. Due to the finite size of real-world networks, the power law inevitably has a cutoff at some maximum degree Δ. We investigate the relative size of the giant component S in the large-network limit. We show that S as a function of Δ increases fast when Δ is just large enough for the giant component to exist, but increases ever more slowly when Δ increases further. This gives that while the degree distribution converges to a pure power law when Δ → ∞, S approaches its limiting value at a slow pace. The convergence rate also depends on the power-law exponent τ of the degree distribution. The worst rate of convergence is found to be for the case , which concerns many of the real-world networks reported in the literature.
PACS: 89.75.-k – Complex systems / 64.60.aq – Networks
© EPLA, 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.