Name
Abstract | ||
|---|---|---|
Understanding the importance of links in transmitting information in a network can provide ways to hinder or postpone ongoing dynamical phenomena like the spreading of epidemic or the diffusion of information. In this work, we propose a new measure based on stochastic diffusion processes, the transmission centrality, that captures the importance of links by estimating the average number of nodes to whom they transfer information during a global spreading diffusion process. We propose a simple algorithmic solution to compute transmission centrality and to approximate it in very large networks at low computational cost. Finally we apply transmission centrality in the identification of weak ties in three large empirical social networks, showing that this metric outperforms other centrality measures in identifying links that drive spreading processes in a social network. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1140/epjds/s13688-018-0162-8 | EPJ Data Sci. |
Keywords | DocType | Volume |
Social networks,Link centrality measures,Diffusion processes,Weak tie | Journal | abs/1802.05337 |
Issue | Citations | PageRank |
1 | 1 | 0.35 |
References | Authors | |
23 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qian Zhang | 1 | 38 | 4.65 |
| Márton Karsai | 2 | 422 | 30.42 |
| Alessandro Vespignani | 3 | 1647 | 109.55 |