Abstract
Purpose
There are many complex networks like World-Wide Web, internet and social networks have been reported to be scale-free. The major property of scale-free networks is their degree distributions are in power law form. Generally, the degree exponents of scale-free networks fall into the range of (2, 3). The purpose of this paper is to investigate other situations where the degree exponents may lie outside the range.
Design/methodology/approach
In this paper, analysis has been carried out by varying the degree exponents in the range of (0.5, 4.5). In total, 243 scenarios have been generated with varying network size of 1,000, 2,000 and 4,000, and degree exponents in the range of (0.5, 4.5) using interval of 0.05.
Findings
The following five indicators have been investigated: average density, average clustering coefficient, average path length, average diameter and average node degree. These indicators vary with the network size and degree exponent. If certain indicators do not satisfy with the user requirement using degree exponents of (2, 3), one can further increase or decrease the value with tradeoff. Results recommend that for degree exponents in (0.5, 2), 26 possible scale-free networks can be selected whereas for (3, 4.5), 41 possible scale-free networks can be selected, assuming a 100 percent deviation on the network parameters.
Originality/value
A tolerance analysis is given for the tradeoff and guideline is drawn to help better design of scale-free network for degree exponents in range of (0.5, 2) and (3, 4.5) using network size 1,000, 2,000 and 4,000. The methodology is applicable to any network size.
Subject
Library and Information Sciences,Information Systems
Reference27 articles.
1. The early history and emergence of molecular functions and modular scale-free network behavior;Scientific Reports,2016
2. Emergence of scaling in random networks;Science,1999
3. Resilience of the world wide web: a longitudinal two-mode network analysis;Social Network Analysis and Mining,2016
4. On the numerical study of percolation and epidemic critical properties in networks;The European Physical Journal B,2016
5. Efficiency of scale-free networks: error and attack tolerance;Physica A: Statistical Mechanics and its Applications,2003
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献