A Novel Method to Identify Important Edges in a Directed Network
Identifying the key components in complex systems is crucial for ensuring the functionality and integrity of the system. For directed networks, both nodes and edges are critical components, but little attention has been drawn to the important edges. In this paper, a novel method, Cooperation–Competi...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-03-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/14/4/258 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Identifying the key components in complex systems is crucial for ensuring the functionality and integrity of the system. For directed networks, both nodes and edges are critical components, but little attention has been drawn to the important edges. In this paper, a novel method, Cooperation–Competition Centrality (Co-Com Centrality), has been proposed to quantify the edge importance in a directed network. This method utilizes cooperation and competition relationships to integrate the local and global information about the network. We compare the performance of Co-Com Centrality with five typical methods in nine networks; the experiments show that Co-Com Centrality can accurately identify edges which are crucial for maintaining global network efficiency and network stability, while also accurately assessing the edge importance. |
|---|---|
| ISSN: | 2075-1680 |