Abstract
Centrality indices quantify the importance of a node in a given network, which is often identified with the importance of the corresponding entity in the complex system modeled by the network. As the perceived importance is dependent on the kind of network to be analyzed, different centrality indices have been proposed over the years. This chapter gives a short overview of the most important centrality indices, a characterization of centrality indices based on graph-theory, visualization of centrality indices, and some general schemes of how centrality indices are used to analyze networks with selected examples. The main insight of the chapter is that it is necessary to carefully match a centrality index with the research question of interest to enable a meaningful interpretation of the index’ results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
One of these is Sabidussi’s definition which requires, among others, that adding an edge to the most central vertex of a graph should result in a graph in which this node is still the most central [44, p. 13–15]. This does not hold for many classic centrality indices, e.g., closeness or eccentricity described below.
- 2.
This index was introduced by Sade as n-path centrality but since n is normally defined as the number of nodes in a graph, Borgatti and Everett called it the k-path centrality; k denotes the maximal length of a path to be considered [45].
- 3.
- 4.
The index was introduced by Shimbel as accessibility [46, Eq. 3].
- 5.
Technically, it was first defined by Anthonisse in a technical report as the so-called rush in a network [2]. It was, however, only a technical description of it, without a deduction from or application to a real-world problem.
- 6.
Note that Freeman explicitly excluded the start and target nodes of a shortest path, i.e., \(\sigma _{st}(s):=\sigma _{st}(t)=0\).
- 7.
Note that technically it is a bit more complicated since random walks which walk back and forth over the same node will not contribute to the centrality of this node [41].
- 8.
Borgatti and Everett summarize radial volume or length measures very succinctly in the following way:
It is apparent that all radial measures are constructed the same way. First one defines an actor-by-actor matrix W that records the number or length of walks of some kind linking every pair of actors. Then one summarizes each row of W by taking some kind of mean or total. Thus, centrality provides an overall summary of a node’s participation in the walk structure of the network. It is a measure of how much of the walk structure is due to a given node. It is quite literally the node’s share of the total volume or length of walks in the network. Thus, the essence of a radial centrality measure is this: radial centrality summarizes a node’s connectedness with the rest of the network [10, p. 12].
.
- 9.
Other models let the package wait until the best neighbor is free again, which can lead to dead-locks in which two or more nodes wait for each other to be freed. Yet another model lets the packages wander purely at random.
- 10.
- 11.
The upper diagonal of a matrix comprises all entries A[i, j] where the column counter i is larger than the row counter j.
References
Ahuja RK, Magnati TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall
Anthonisse JM (1971) The rush in a directed graph. Technical report, Stichting Mathematisch Centrum, 2e Boerhaavestraat 49 Amsterdam
Barrat A, Barthélemy M, Vespignani A (2005) The effects of spatial constraints on the evolution of weighted complex networks. J Stat Mech: Theory Exp 5:05003
Bavelas A (1950) Communication patterns in task-oriented groups. J Acoust Soc Am 22(6):725–736
Bonacich P (1972) Factoring and weighting approaches to clique identification. J Math Soc 2:113–120
Bonacich P (2004) The invasion of the physicists. Soc Netw 26:258–288
Bonacich P (2007) Some unique properties of eigenvector centralities. Soc Netw 29:555–564
Borgatti SP (2005) Centrality and network flow. Soc Netw 27:55–71
Borgatti SP (2006) Identifying sets of key players in a social network. Comput Math Organ Theory 12:21–34
Borgatti SP, Everett MG (2006) A graph-theoretic perspective on centrality. Soc Netw 28:466–484
Brandes U (2001) A faster algorithm for betweenness centrality. J Math Soc 25(2):163–177
Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Soc Netw 30:136–145
Brandes U, Erlebach T (eds) (2005) Network analysis—methodological foundations. LNCS, vol 3418. Springer
Brandes U, Kenis P, Wagner D (2003) Communicating centrality in policy network drawings. IEEE Trans Vis Comput Graph 9:241–253
Broder A, Kumar R, Maghoul F, Raghavan P, Rajagopalan S, Stat R, Tomkins A, Wiener J (2000) Graph structure in the web. Comput Netw 33:309–320
Coulomb S, Bauer M, Bernard D, Marsolier-Kergoat M-C (2005) Gene essentiality and the topology of protein interaction networks. Proc R Soc Lond B 272:1721–1725
Dorn I, Lindenblatt A, Zweig KA (2012) The trilemma of network analysis. In: Proceedings of the 2012 IEEE/ACM international conference on advances in social network analysis and mining, Istanbul
Everett MG, Borgatti SP (1999) The centrality of groups and classes. J Math Soc 23(3):181–201
Everett M, Borgatti SP (2005) Ego network betweenness. Soc Netw 27:31–38
Everett MG, Borgatti SP (2005) Models and methods in network analysis. Extending centrality. Cambridge University Press, Cambridge
Faust K (1997) Centrality in affiliation networks. Soc Netw 19:157–191
Freeman LC (1977) A set of measures of centrality based upon betweenness. Sociometry 40:35–41
Freeman LC (1979) Centrality in networks: I. conceptual clarifications. Soc Netw 1:215–239
Goh K-I, Kahng B, Kim D (2001) Universal behavior of load distribution in scale-free networks. Phys Rev Lett 87(27):278701
Goh K-I, Eulsik O, Jeong H, Kahng B, Kim D (2002) Classification of scale-free networks. Nature 99(20):12583–12588
Guimerá R, Amaral LAN (2004) Modeling the world-wide airport network. Eur Phys J B 38:381–385
Guimerá R, Mossa S, Turtschi A, Amaral LAN (2005) The worldwide air transportation network: anomalous centrality, community structure, and cities’ global roles. Proc Natl Acad Sci 102:7794–7799
Hage P, Harary F (1995) Eccentricity and centrality in networks. Soc Netw 17:57–63
Holme P (2003) Congestion and centrality in traffic flow on complex networks. Adv Complex Syst 6:163
Jacob R, Koschützki D, Lehmann KA, Peeters L, Tenfelde-Podehl D (2005) Network analysis—methodological foundations. Algorithms for centrality indices. Springer
Jeong H, Mason SP, Barabási A-L, Oltvai ZN (2001) Lethality and centrality in protein networks. Nature 411:41–42
Jordan C (1869) Sur les assemblages de lignes. Journal für reine und angewandte Mathematik 70:185–190
Katz L (1953) A new index derived from sociometric data analysis. Psychometrika 18:39–43
Koschützki D, Schreiber F (2004) Comparison of centralities for biological networks. In: Proceedings of the German conference of bioinformatics (GCB’04)
Koschützki D, Lehmann KA, Peeters L, Richter S, Tenfelde-Podehl D, Zlotowski O (2005) Network analysis—methodological foundations. Centrality indices. LNCS, vol 3418 of Brandes and Erlebach [13], pp 16–60
Koschützki D, Lehmann KA, Tenfelde-Podehl D, Zlotowski O (2005) Network analysis—methodological foundations. Advanced centrality concepts. LNCS, vol 3418 of Brandes and Erlebach [13], pp 83–110
Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discovery Data (TKDD) 1(1):No 2
Newman ME (2010) Networks: an introduction. Oxford University Press, New York
Newman MEJ (2001) Scientific collaboration networks. ii. shortest paths, weighted networks, and centrality. Phys Rev E 64:016132
Newman MEJ (2004) Analysis of weighted networks. Phys Rev E 70(5):056131
Newman MEJ (2005) A measure of betweenness centrality based on random walks. Soc Netw 27:39–54
Pitts FR (1965) A graph theoretic approach to historical geography. Prof Geogr 17(5):15–20
Ruhnau B (2000) Eigenvector-centrality—a node centrality? Soc Netw 22(4):357–365
Sabidussi G (1966) The centrality index of a graph. Psychometrika 31:581–603
Sade DS (1989) Sociometrics of macaca mulatta III: n-path centrality in grooming networks. Soc Netw 11:273–292
Shimbel A (1953) Structural parameters of communication networks. Bull Math Biophys 15:501–507
Sudarshan Iyengar SR, Abhiram Natarajan KZ, Veni Madhavan CE (2011) A network analysis approach to understand human-wayfinding problem. In: Proceedings of the 33rd annual meeting of the cognitive science society
Sudarshan Iyengar SR, Veni Madhavan CE, Zweig KA, Natarajan A (2012) Understanding human navigation using network analysis. TopiCS—Topics Cogn Sci 4(1):121–134
Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393:440–442 June
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer-Verlag GmbH Austria
About this chapter
Cite this chapter
Zweig, K.A. (2016). Centrality Indices. In: Network Analysis Literacy. Lecture Notes in Social Networks. Springer, Vienna. https://doi.org/10.1007/978-3-7091-0741-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-7091-0741-6_9
Published:
Publisher Name: Springer, Vienna
Print ISBN: 978-3-7091-0740-9
Online ISBN: 978-3-7091-0741-6
eBook Packages: Computer ScienceComputer Science (R0)