z-logo
open-access-imgOpen Access
Segregation dynamics driven by network leaders
Author(s) -
Wenxuan Wang,
Yuhao Feng,
Siru Chen,
Wenzhe Xu,
Xinjian Zhuo,
Hui-Jia Li,
Matjaž Perc
Publication year - 2022
Publication title -
new journal of physics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.584
H-Index - 190
ISSN - 1367-2630
DOI - 10.1088/1367-2630/ac65a7
Subject(s) - complex network , network dynamics , perspective (graphical) , network formation , key (lock) , network structure , dynamics (music) , evolutionary dynamics , physics , management science , computer science , theoretical computer science , artificial intelligence , sociology , computer security , economics , mathematics , acoustics , population , demography , discrete mathematics , world wide web
Network segregation – a critical problem in real-life networks – can reveal the emergence of conicts or signal an impending collapse of the whole system. However, the strong heterogeneity of such networks and the various denitions for key nodes continue to pose challenges that limit our ability to foresee segregation and to determine the main drivers behind it. In this paper, we show that a multi-agent leader-follower consensus system can be utilized to dene a new index, named leadership, to identify key leaders in real-life networks. And then, this paper explores the emergence of network segregation that is driven by these leaders based on the removal or the rewiring of the relations between dierent nodes in agreement with their contribution distance. We nally show that the observed leaders-driven segregation dynamics reveals the dynamics of heterogeneous attributes that critically inuence network structure and its segregation. Thus, this paper provides a theoretical method to study complex social interactions and their roles in network segregation, which ultimately leads to a closed-form explanation for the emergence of imbalanced network structure from an evolutionary perspective.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here