Abstract | ||
---|---|---|
The identification of nodes occupying important positions in a network structure is crucial for the understanding of the associated real-world system. Usually, betweenness centrality (BC) is used to evaluate a node capacity to connect different graph regions. However, we argue here that this measure is not adapted for that task, as it gives equal weight to ‘local’ centres (i.e. nodes of high-degre... |
Year | DOI | Venue |
---|---|---|
2015 | 10.1093/comnet/cnv022 | Journal of Complex Networks |
Keywords | Field | DocType |
centrality measures,betweenness centrality,bridgeness centrality | Network science,Random walk closeness centrality,Computational mathematics,Network controllability,Centrality,Theoretical computer science,Betweenness centrality,Network theory,Artificial intelligence,Katz centrality,Mathematics,Machine learning | Journal |
Volume | Issue | ISSN |
4 | 3 | 2051-1310 |
Citations | PageRank | References |
2 | 0.53 | 5 |
Authors | ||
9 |
Name | Order | Citations | PageRank |
---|---|---|---|
pablo jensen | 1 | 2 | 1.21 |
Matteo Morini | 2 | 3 | 2.23 |
Márton Karsai | 3 | 422 | 30.42 |
Tommaso Venturini | 4 | 26 | 5.01 |
Alessandro Vespignani | 5 | 1647 | 109.55 |
Mathieu Jacomy | 6 | 803 | 41.42 |
Jean-Philippe Cointet | 7 | 113 | 12.20 |
pierre merckle | 8 | 2 | 0.53 |
Eric Fleury | 9 | 243 | 23.71 |