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, α-current flow betweenness and truncated α-current flow betweenness, which can be computed fast and correlate well with the original current flow betweenness.
This research is partially funded by Inria Alcatel-Lucent Joint Lab, by the European Commission within the framework of the CONGAS project FP7-ICT-2011-8-317672, see www.congas-project.eu , and by the EU-FET Open grant NADINE (288956).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs (1999)
Boldi, P., Vigna, S.: Axioms for centrality. arXiv:1308.2140
Boldi, P., Vigna, S.: In-core computation of geometric centralities with hyperball: A hundred billion nodes and beyond. arXiv:1308.2144
Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25(1994), 163–177 (2001)
Brandes, U., Fleischer, D.: Centrality measures based on current flow. In: Proceedings of the 22nd Annual Conference on Theoretical Aspects of Computer Science, pp. 533–544 (2005)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and {ISDN} Systems 30(1-7), 107–117 (1998)
Doyle, P.G., Snell, J.L.: Random walks and electric networks. Mathematical Association of America (1984)
Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry (1977)
Grolmusz, V.: A note on the pagerank of undirected graphs. arXiv preprint arXiv:1205.1960 (2012)
Holme, P., Kim, B.J., Yoon, C.N., Han, S.K.: Attack vulnerability of complex networks. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics 65(5, pt. 2), 056109 (2002)
Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology 54(4), 396–405 (2003)
Newman, M.E.J.: A measure of betweenness centrality based on random walks. Social Networks, 1–15 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Avrachenkov, K., Litvak, N., Medyanikov, V., Sokol, M. (2013). Alpha Current Flow Betweenness Centrality. In: Bonato, A., Mitzenmacher, M., Prałat, P. (eds) Algorithms and Models for the Web Graph. WAW 2013. Lecture Notes in Computer Science, vol 8305. Springer, Cham. https://doi.org/10.1007/978-3-319-03536-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-03536-9_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03535-2
Online ISBN: 978-3-319-03536-9
eBook Packages: Computer ScienceComputer Science (R0)