# Alpha current flow betweenness centrality

1 MAESTRO - Models for the performance analysis and the control of networks
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : A class of centrality measures called betweenness centralities reflects degree of participation of edges or nodes in communication between different parts of the network. The original shortest-path betweenness centrality is based on counting shortest paths which go through a node or an edge. One of shortcomings of the shortest-path betweenness centrality is that it ignores the paths that might be one or two hops longer than the shortest paths, while the edges on such paths can be important for communication processes in the network. To rectify this shortcoming a current flow betweenness centrality has been proposed. Similarly to the shortest-path betweenness, it has prohibitive complexity for large size networks. In the present work we propose two regularizations of the current flow betweenness centrality, $\alpha$-current flow betweenness and truncated $\alpha$-current flow betweenness, which can be computed fast and correlate well with the original current flow betweenness.
Type de document :
Communication dans un congrès
WAW - 10th International Workshop on Algorithms and Models for the Web Graph, Dec 2013, Cambridge, Massachusetts, United States. 8305, pp.106-117, 2013, Lecture Notes in Computer Science. 〈http://link.springer.com/chapter/10.1007/978-3-319-03536-9_9〉. 〈10.1007/978-3-319-03536-9_9〉

Littérature citée [12 références]

https://hal.inria.fr/hal-00926438
Contributeur : Konstantin Avrachenkov <>
Soumis le : jeudi 9 janvier 2014 - 15:37:35
Dernière modification le : dimanche 25 février 2018 - 14:48:02
Document(s) archivé(s) le : jeudi 10 avril 2014 - 11:00:29

### Fichier

AlphaCurrentFlow_WAW2013.pdf
Fichiers produits par l'(les) auteur(s)

### Citation

Konstantin Avrachenkov, Nelly Litvak, Vasily Medyanikov, Marina Sokol. Alpha current flow betweenness centrality. WAW - 10th International Workshop on Algorithms and Models for the Web Graph, Dec 2013, Cambridge, Massachusetts, United States. 8305, pp.106-117, 2013, Lecture Notes in Computer Science. 〈http://link.springer.com/chapter/10.1007/978-3-319-03536-9_9〉. 〈10.1007/978-3-319-03536-9_9〉. 〈hal-00926438〉

### Métriques

Consultations de la notice

## 240

Téléchargements de fichiers