Alpha current flow betweenness centrality

DOI10.1007/978-3-319-03536-9_9zbMATH Open1342.05153arXiv1308.2591OpenAlexW2150353969MaRDI QIDQ2938020FDOQ2938020

Authors: Nelly Litvak, Vasily Medyanikov, Marina Sokol, Konstantin Avrachenkov 

Publication date: 13 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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 steps 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 betwe 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.

Full work available at URL: https://arxiv.org/abs/1308.2591

Recommendations

• STACS 2005
• A variant of the current flow betweenness centrality and its application in urban networks
• Routing betweenness centrality
• Betweenness centrality in some classes of graphs
• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality

zbMATH Keywords

centrality measuresbetweenness centralities

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Flows in graphs (05C21) Network design and communication in computer systems (68M10)

Cited In (6)

• Routing betweenness centrality
• A variant of the current flow betweenness centrality and its application in urban networks
• Analyzing complex networks through correlations in centrality measurements
• STACS 2005
• Paths and flows for centrality measures in networks
• Estimating current-flow closeness centrality with a multigrid Laplacian solver

This page was built for publication: Alpha current flow betweenness centrality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938020)