Tolerance analysis in scale-free social networks with varying degree exponents

被引:7
|
作者
Chui, Kwok Tai [1 ]
Shen, Chien-wen [2 ]
机构
[1] City Univ Hong Kong, Dept Elect Engn, Kowloon Tong, Hong Kong, Peoples R China
[2] Natl Cent Univ, Dept Business Adm, Taoyuan, Taiwan
关键词
Library networks; Social network; Tolerance analysis; Complex network; Degree exponent; Scale-free network; WEB;
D O I
10.1108/LHT-07-2017-0146
中图分类号
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号
1205 ; 120501 ;
摘要
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.
引用
下载
收藏
页码:57 / 71
页数:15
相关论文
共 50 条
  • [21] Exploration of scale-free networks - Do we measure the real exponents?
    Petermann, T
    De los Rios, P
    EUROPEAN PHYSICAL JOURNAL B, 2004, 38 (02): : 201 - 204
  • [22] Protein domain networks: Scale-free mixing of positive and negative exponents
    Nacher, J. C.
    Hayashida, M.
    Akutsu, T.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2006, 367 : 538 - 552
  • [23] Cascades Tolerance of Scale-Free Networks with Attack Cost
    Chen Hong
    Nai-Yu Yin
    Ning He
    Oriol Lordan
    Jose Maria Sallan
    International Journal of Computational Intelligence Systems, 2017, 10 : 1330 - 1336
  • [24] On the Visualization of Social and Other Scale-Free Networks
    Jia, Yuntao
    Hoberock, Jared
    Garland, Michael
    Hart, John C.
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2008, 14 (06) : 1285 - 1292
  • [25] Weighted scale-free networks with variable power-law exponents
    Tanaka, Takurna
    Aoyagi, Toshio
    PHYSICA D-NONLINEAR PHENOMENA, 2008, 237 (07) : 898 - 907
  • [26] Robustness Analysis of the Scale-Free Networks
    Zhang, Jianhua
    Song, Bo
    Zhang, Zhaojun
    Zhao, Mingwei
    INTERNATIONAL CONFERENCE ON FUTURE INFORMATION ENGINEERING (FIE 2014), 2014, 10 : 177 - 183
  • [27] Subnets of scale-free networks are not scale-free: Sampling properties of networks
    Stumpf, MPH
    Wiuf, C
    May, RM
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2005, 102 (12) : 4221 - 4224
  • [28] Effects of random rewiring on the degree correlation of scale-free networks
    Qu, Jing
    Wang, Sheng-Jun
    Jusup, Marko
    Wang, Zhen
    SCIENTIFIC REPORTS, 2015, 5
  • [29] Maximum matchings in scale-free networks with identical degree distribution
    Li, Huan
    Zhang, Zhongzhi
    THEORETICAL COMPUTER SCIENCE, 2017, 675 : 64 - 81
  • [30] Rumor dynamics in weighted scale-free networks with degree correlations
    Singh, Anurag
    Singh, Yatindra Nath
    JOURNAL OF COMPLEX NETWORKS, 2015, 3 (03) : 450 - 468