.png){kind=icon}
Return
Finding Core-Periphery Structures With Node Influences
.png){kind=icon}
OA
AI
DOI：10.1109/TNSE.2021.3138436.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Detecting core-periphery structures is one of the outstanding issues in complex network analysis. Various algorithms can identify core nodes and periphery nodes. Recent advances found that many networks from real-world data can be better modeled with multiple pairs of core-periphery nodes. In this study, we propose to use an influence propagation process to detect multiple pairs of core-periphery nodes. In this framework, we assume each node can emit a certain amount of influence and propagate it through the network. Then we identify nodes with large influences as core nodes, and we utilize a maximum influence chain to construct a node-pairing network to determine core-periphery pairs. This approach can take node interactions into consideration and can reduce noises in finding pairs. Experiments on randomly generated networks and real-world networks confirm the efficiency and accuracy of our algorithm.
Keywords:
Detection algorithms
Complex networks
Image edge detection
Periodic structures
Stochastic processes
Psychology
Proteins
Core-periphery structure
complex networks
node influences
computational modeling
unsupervised learning
Journal
I
IF:
7.9
Papers:
2.5K
Citations:
10.0K
Organization
Cited Papers
ShareSaveShareSaveOverlapping Communities Explain Core-Periphery Organization of Networks.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
ShareSave
ShareSaveShareSave
View more