Will Scale-Free Popularity Develop Scale-Free Geo-Social Networks?

被引:4
|
作者
Liu, Dong [1 ]
Fodor, Viktoria [1 ]
Rasmussen, Lars Kildehoj [1 ]
机构
[1] KTH Royal Inst Technol, Sch Elect Engn & Comp Sci, Access Linnaeus Ctr, SE-10044 Stockholm, Sweden
基金
瑞典研究理事会;
关键词
Social tie; network model; popularity; geographic distance; degree distribution; clustering coefficient; COMMUNICATION; EVOLUTION; MODELS;
D O I
10.1109/TNSE.2018.2841942
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Empirical results show that spatial factors such as distance, population density and communication range affect our social activities, also reflected by the development of ties in social networks. This motivates the need for social network models that take these spatial factors into account. Therefore, in this paper we propose a gravity-low-based geo-social network model, where connections develop according to the popularity of the individuals, but are constrained through their geographic distance and the surrounding population density. Specifically, we consider a power-law distributed popularity, and random node positions governed by a Poisson point process. We evaluate the characteristics of the emerging networks, considering the degree distribution, the average degree of neighbors and the local clustering coefficient. These local metrics reflect the robustness of the network, the information dissemination speed and the communication locality. We show that unless the communication range is strictly limited, the emerging networks are scale-free, with a rank exponent affected by the spatial factors. Even the average neighbor degree and the local clustering coefficient show tendencies known in non-geographic scale-free networks, at least when considering individuals with low popularity. At high-popularity values, however, the spatial constraints lead to popularity-independent average neighbor degrees and clustering coefficients.
引用
收藏
页码:587 / 598
页数:12
相关论文
共 50 条
  • [41] On synchronization of scale-free dynamical networks
    Fan, J
    Wang, XF
    [J]. 2004 8TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION, VOLS 1-3, 2004, : 595 - 600
  • [42] An improved scale-free networks model
    Wang, Ting
    Cai, Guoyong
    Huang, Xiong
    [J]. MODERN COMPUTER SCIENCE AND APPLICATIONS (MCSA 2016), 2016, : 309 - 316
  • [43] Scale-free aggregation in sensor networks
    Enachescu, M
    Goel, A
    Govindan, R
    Motwani, R
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 344 (01) : 15 - 29
  • [44] Resilience Notions for Scale-Free Networks
    Ercal, Gunes
    Matta, John
    [J]. COMPLEX ADAPTIVE SYSTEMS: EMERGING TECHNOLOGIES FOR EVOLVING SYSTEMS: SOCIO-TECHNICAL, CYBER AND BIG DATA, 2013, 20 : 510 - 515
  • [45] Dynamical advantages of scale-free networks
    Willeboordse, FH
    [J]. PHYSICAL REVIEW LETTERS, 2006, 96 (01)
  • [46] Scale-free growing networks and gravity
    Nieto, J. A.
    [J]. REVISTA MEXICANA DE FISICA, 2013, 59 (03) : 201 - 204
  • [47] An imperfect competition on scale-free networks
    Konno, Tomohiko
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2013, 392 (21) : 5453 - 5460
  • [48] The Concept of Elasticity of Scale-Free Networks
    Shergin, Vadim
    Chala, Larysa
    [J]. 2017 4TH INTERNATIONAL SCIENTIFIC-PRACTICAL CONFERENCE PROBLEMS OF INFOCOMMUNICATIONS-SCIENCE AND TECHNOLOGY (PIC S&T), 2017, : 257 - 260
  • [49] Scale-free networks as entropy competition
    Sanchirico, Antonio
    Fiorentino, Mauro
    [J]. PHYSICAL REVIEW E, 2008, 78 (04)
  • [50] Infection dynamics on scale-free networks
    May, RM
    Lloyd, AL
    [J]. PHYSICAL REVIEW E, 2001, 64 (06):