Identifying Influential Edges by Node Influence Distribution and Dissimilarity Strategy
Identifying influential edges in a complex network is a fundamental topic with a variety of applications. Considering the topological structure of networks, we propose an edge ranking algorithm DID (Dissimilarity Influence Distribution), which is based on node influence distribution and dissimilarit...
Main Authors: | Yanjie Xu, Tao Ren, Shixiang Sun |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-10-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/20/2531 |
Similar Items
-
MINE: Identifying Top-<i>k</i> Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion
by: Xinyu Huang, et al.
Published: (2020-08-01) -
A novel voting measure for identifying influential nodes in complex networks based on local structure
by: Haoyang Li, et al.
Published: (2025-01-01) -
Identifying Influential Nodes of Complex Networks Based on Trust-Value
by: Jinfang Sheng, et al.
Published: (2020-11-01) -
Community Detection Based on Node Influence and Similarity of Nodes
by: Yanjie Xu, et al.
Published: (2022-03-01) -
An improved voterank algorithm to identifying a set of influential spreaders in complex networks
by: Yaxiong Li, et al.
Published: (2022-08-01)