Advertisement

Efficient Extraction of High-Betweenness Vertices from Heterogeneous Networks

  • Wen Haw Chong
  • Wei Shan Belinda Toh
  • Loo Nin Teow
Chapter
Part of the Lecture Notes in Social Networks book series (LNSN, volume 6)

Abstract

Centrality measures are crucial in quantifying the roles and positions of vertices in complex network analysis. An important and popular measure is betweenness centrality, which is computed based on the number of shortest paths that vertices fall on. However, betweenness is computationally expensive to derive, resulting in much research on efficient computation techniques. We note that in many applications, it is the set of vertices with high betweenness that is of key interest and that their betweenness rankings rather than the exact values is usually adequate for analysts to work with. Hence, we have developed a novel algorithm that efficiently returns the set of vertices with highest betweenness. The convergence criterion for our algorithm is based on the membership stability of the high-betweenness set. Through experiments on various artificial and real-world networks, we show that the algorithm is both efficient and accurate. From the experiments, we also demonstrated that the algorithm tends to perform better on networks with heterogeneous betweenness distributions.

Keywords

Betweenness Centrality Small World Network Mean Average Precision Border Gateway Protocol High Betweenness 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Anthonisse, J.: The rush in a directed graph. Technical Reports BN 9/71, Stichting Mathematisch Centrum (1971)Google Scholar
  2. 2.
    Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E 71(3), 036113 (2005)CrossRefGoogle Scholar
  4. 4.
    Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. RSA Random Struct. Algorithms 18, 279–290 (2001)zbMATHCrossRefGoogle Scholar
  5. 5.
    Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 2(25), 163–177 (2001)CrossRefGoogle Scholar
  6. 6.
    Brandes, U., Pich, C.: Centrality estimation in large networks. Int. J. Bifurc. Chaos 7(17), 2303–2318 (2007)MathSciNetGoogle Scholar
  7. 7.
    CAIDA: The CAIDA AS relationship dataset. http://www.caida.org/data/active/as-relationships (2007)
  8. 8.
    Corman, S.R., Kuhn, T., Mcphee, R.D., Dooley, K.J.: Studying complex discursive systems. Hum. Commun. Res. 28(2), 157–206 (2002)Google Scholar
  9. 9.
    Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977)CrossRefGoogle Scholar
  10. 10.
    Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30, 1141–1144 (1959)zbMATHCrossRefGoogle Scholar
  11. 11.
    Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 301(58), 713–721 (1963)MathSciNetGoogle Scholar
  12. 12.
    Jeong, H., Mason, S.P., Barabasi, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411, 41–42 (2001)CrossRefGoogle Scholar
  13. 13.
    Ley, M.: The DBLP computer science bibliography. http://www.informatik.uni-trier.de/~ley/db
  14. 14.
    Maiya, A.S., Berger-Wolf, T.Y.: Online sampling of high centrality individuals in social networks. In: Zaki, M.J., Yu, J.X., Ravindran, B. Pudi, V. (eds.) Advances in Knowledge Discovery and Data Mining, 14th Pacific-Asia Conference, PAKDD 2010, Hyderabad. Proceedings. Part I, Lecture Notes in Computer Science, vol. 6118, pp. 91–98. Springer, Berlin (2010)Google Scholar
  15. 15.
    Newman, M.E.J., Watts, D.J.: Renormalization group analysis of the small-world network model. Phys. Lett. A 263, 341–346 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Okamoto, K., Chen, W., yang Li, X.: Ranking of closeness centrality for large-scale social networks. In: Proceedings of the 2nd Annual International Workshop on Frontiers in Algorithmics, 2008, pp. 186–195. Springer-Verlag Berlin, Heidelberg (2008)Google Scholar
  17. 17.
    Shetty, J., Adibi, J.: Enron Dataset. http://www.isi.edu/~adibi/Enron/Enron.htm (2004)
  18. 18.
    Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (1983)CrossRefGoogle Scholar
  19. 19.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)CrossRefGoogle Scholar
  20. 20.
    Wu, J., Tan, Y.J., Deng, H.Z., Zhu, D.Z.: A new measure of heterogeneity of complex networks based on degree sequence. In: International Conference on Complex Systems. Springer, Berlin/New York (2006)Google Scholar

Copyright information

© Springer-Verlag Wien 2013

Authors and Affiliations

  • Wen Haw Chong
    • 1
  • Wei Shan Belinda Toh
    • 1
  • Loo Nin Teow
    • 1
  1. 1.DSO National LaboratoriesSingaporeSingapore

Personalised recommendations