Node influence of the dynamic networks

被引:7
|
作者
Ren Zhuo-Ming [1 ]
机构
[1] Hangzhou Normal Univ, Alibaba Business Sch, Res Ctr Complex Sci, Hangzhou 311121, Peoples R China
基金
中国国家自然科学基金;
关键词
growing networks; time-variant dynamic network; network perturbation; node influence; COMPLEX; IDENTIFICATION; CENTRALITY; SPREADERS; SYSTEMS;
D O I
10.7498/aps.69.20190830
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Crucial to the physicists' strong interest in the field is the fact that such macroscopic properties typically arise as the result of a myriad of interactions between the system constituents. Network science aims at simplifying the study of a given complex system by representing it as a network, a collection of nodes and edges interconnecting them. Nowadays, it is widely recognized that some of the structural traits of networks are in fact ubiquitous properties in real systems. The identification and prediction of node influence are of great theoretical and practical significance to be known as a hot research field of complex networks. Most of current research advance is focused on static network or a snapshot of dynamic networks at a certain moment. However, in practical application scenarios, mostly complex networks extracted from society, biology, information, technology are evolving dynamically. Therefore, it is more meaningful to evaluate the node's influence in the dynamic network and predict the future influence of the node, especially before the change of the network structure. In this summary, we contribute on reviewing the improvement of node influence in dynamical networks, which involves three tasks: algorithmic complexity and time bias in growing networks; algorithmic applicability in time varying networks; algorithmic robustness in a dynamical network with small or sharp perturbation. Furthermore, we overview the framework of economic complexity based on dynamical network structure. Lastly, we point out the forefront as well as critical challenges of the field.
引用
收藏
页数:9
相关论文
共 89 条
  • [1] A consistent metric for nestedness analysis in ecological systems: reconciling concept and measurement
    Almeida-Neto, Mario
    Guimaraes, Paulo
    Guimaraes, Paulo R., Jr.
    Loyola, Rafael D.
    Ulrich, Werner
    [J]. OIKOS, 2008, 117 (08) : 1227 - 1239
  • [2] Identifying Influential and Susceptible Members of Social Networks
    Aral, Sinan
    Walker, Dylan
    [J]. SCIENCE, 2012, 337 (6092) : 337 - 341
  • [3] Synchronization in complex networks
    Arenas, Alex
    Diaz-Guilera, Albert
    Kurths, Jurgen
    Moreno, Yamir
    Zhou, Changsong
    [J]. PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2008, 469 (03): : 93 - 153
  • [4] Barzel B, 2013, NAT PHYS, V9, P673, DOI [10.1038/nphys2741, 10.1038/NPHYS2741]
  • [5] A Survey on PageRank Computing
    Berkhin, Pavel
    [J]. INTERNET MATHEMATICS, 2005, 2 (01) : 73 - 120
  • [6] Complex networks: Structure and dynamics
    Boccaletti, S.
    Latora, V.
    Moreno, Y.
    Chavez, M.
    Hwang, D. -U.
    [J]. PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5): : 175 - 308
  • [7] A 61-million-person experiment in social influence and political mobilization
    Bond, Robert M.
    Fariss, Christopher J.
    Jones, Jason J.
    Kramer, Adamd. I.
    Marlow, Cameron
    Settle, Jaime E.
    Fowler, James H.
    [J]. NATURE, 2012, 489 (7415) : 295 - 298
  • [8] Centrality and network flow
    Borgatti, SP
    [J]. SOCIAL NETWORKS, 2005, 27 (01) : 55 - 71
  • [9] Network Analysis in the Social Sciences
    Borgatti, Stephen P.
    Mehra, Ajay
    Brass, Daniel J.
    Labianca, Giuseppe
    [J]. SCIENCE, 2009, 323 (5916) : 892 - 895
  • [10] The $25,000,000,000 eigenvector: The linear algebra behind google
    Bryan, Kurt
    Leise, Tanya
    [J]. SIAM REVIEW, 2006, 48 (03) : 569 - 581