Overview of Centrality

  • Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin.[1]
    They should not be confused with node influence metrics, which seek to quantify the influence of every node in the network.
  • Centrality indices are answers to the question “What characterizes an important node?” The answer is given in terms of a real-valued function on the vertices of a graph, where the values produced are expected to provide a ranking that identifies the most important nodes.
  • Centrality comes in alternative flavors and each flavor or a metric defines importance of a node from a alternative perspective and further provides relevant analytical information about the graph and its nodes.
  • Centrality indices are explicitly designed to produce a ranking which allows indication of the most important vertices.[2][3] This they do well, under the limitation just noted.
  • Centrality differences (PRFAR-bound – APO) for an exponential damping λ=5 Å as a function of the residue index (Left) and plotted on top of the protein representation (Right).
  • Centrality measure values compute times on homemade graphs and Stanford-web graph are calculated on MacBook Pro with four cores and 16GB RAM.
  • Centrality measurement, which include degree centrality, betweenness, and eigenvector centrality, are among the most popular ones.
  • Centrality is often the first measurement introduced to those learning about network analysis due to its wide application.
  • Centrality
    should thus not be considered to be on an interval scale, but rather an ordinal one.
  • Centrality is still in in development 2 years after ico with no working product.
  • Mine

    (Since the roster data and the nominations data for the Cameroonian women’s voluntary organizations were considered as two distinct datasets, exclusion of data from one of the women’s voluntary organizations resulted in the loss of two networks)..Further information on these datasets are available in Costenbader & Valente, 2003; Valente, 1995.Given that our aim was to determine how well centrality measures correlated with one another, we felt it would be more difficult to make this comparison if information from a large portion of the network was not collected.Since networks in the same study often shared similar attributes, it would be cumbersome to present the characteristics of all 58 of these networks.Table 2 presents the average properties of the networks in the 7 studies.Therefore, we excluded from our study any network in which less than 50% of the enumerated population initially responded to the network questions.Using this criterion, we excluded one of the Illinois communities, one Korean village, and one of the Cameroonian women’s voluntary organizations, leaving a final sample of 58 networks.


    (The measure can be used for “three steps” or “four steps,” but for our purposes the frequently employed “2step-reach” is the most useful.) The fourth centrality measure, “eigenvector,” requires a bit more explaining.Four frequently used centrality measures indicators include “degree,” which is based on the number of direct links the organization has to others in the network; “betweenness,” which is based on the number of times the organization is part of the shortest pathway between two other organizations; and “reach,” which is based on the number of organizations that an organization is linked to through two steps.

    Can Harmonic Centrality Be the New PageRank?

    Here’s an in-depth look into harmonic centrality, why it’s useful for search engines, and how it compares against PageRank.

    Want to learn more?

    Our white paper has lots more detail about social network analysis, centrality measures and how to visualize social networks.

    Want to learn more?

    Our white paper has lots more detail about social network analysis, centrality measures and how to visualize social networks.

    Why register for an account?

    A Family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced.These measures define centrality in terms of the degree to which a point falls on the shortest path between others and therefore has a potential for control of communication.They may be used to index centrality in any large or small network of symmetrical relations, whether connected or unconnected.

    History of Centrality