Advertisement

Approximating Personalized Katz Centrality in Dynamic Graphs

  • Eisha NathanEmail author
  • David A. Bader
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10777)

Abstract

Dynamic graphs can capture changing relationships in many real datasets that evolve over time. One of the most basic questions about networks is the identification of the “most important” vertices in a network. Measures of vertex importance called centrality measures are used to rank vertices in a graph. In this work, we focus on Katz Centrality. Typically, scores are calculated through linear algebra but in this paper we present an new alternative, agglomerative method of calculating Katz scores and extend it for dynamic graphs. We show that our static algorithm is several orders of magnitude faster than the typical linear algebra approach while maintaining good quality of the scores. Furthermore, our dynamic graph algorithm is faster than pure static recomputation every time the graph changes and maintains high recall of the highly ranked vertices on both synthetic and real graphs.

Keywords

Katz Centrality Dynamic graphs Approximate centrality Personalized centrality 

Notes

Acknowledgments

Eisha Nathan is in part supported by the National Physical Science Consortium Graduate Fellowship. The work depicted in this paper was sponsored in part by the National Science Foundation under award #1339745. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect those of the National Science Foundation.

References

  1. 1.
    Caldarelli, G.: Scale-Free Networks: Complex Webs in Nature and Technology. Oxford University Press, Oxford (2007)CrossRefzbMATHGoogle Scholar
  2. 2.
    Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.-U.: Complex networks: structure and dynamics. Phys. Rep. 424(4), 175–308 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39–43 (1953)CrossRefzbMATHGoogle Scholar
  4. 4.
    Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977)CrossRefGoogle Scholar
  5. 5.
    Green, O., McColl, R., Bader, D.A.: A fast algorithm for streaming betweenness centrality. In: 2012 International Conference on and 2012 International Conference on Social Computing (SocialCom), Privacy, Security, Risk and Trust (PASSAT), pp. 11–20. IEEE (2012)Google Scholar
  6. 6.
    Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web (1999)Google Scholar
  7. 7.
    Bahmani, B., Chowdhury, A., Goel, A.: Fast incremental and personalized pagerank. Proc. VLDB Endow. 4(3), 173–184 (2010)CrossRefGoogle Scholar
  8. 8.
    Langville, A.N., Meyer, C.D.: Updating pagerank with iterative aggregation. In: Proceedings of the 13th International World Wide Web Conference on Alternate Track Papers and Posters, pp. 392–393. ACM (2004)Google Scholar
  9. 9.
    Riedy, J.: Updating pagerank for streaming graphs. In: 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, pp. 877–884. IEEE (2016)Google Scholar
  10. 10.
    Foster, K.C., Muth, S.Q., Potterat, J.J., Rothenberg, R.B.: A faster katz status score algorithm. Comput. Math. Organ. Theory 7(4), 275–285 (2001)CrossRefGoogle Scholar
  11. 11.
    Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Assoc. Inf. Sci. Technol. 58(7), 1019–1031 (2007)CrossRefGoogle Scholar
  12. 12.
    Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)CrossRefzbMATHGoogle Scholar
  13. 13.
    Benzi, M., Klymko, C.: Total communicability as a centrality measure. J. Complex Netw. 1(2), 124–149 (2013)CrossRefGoogle Scholar
  14. 14.
    Benzi, M., Klymko, C.: A matrix analysis of different centrality measures. arXiv preprint arXiv:1312.6722 (2014)
  15. 15.
    Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia (2003)CrossRefzbMATHGoogle Scholar
  16. 16.
    Erdös, P., Rényi, A.: On random graphs, i. Publicationes Mathematicae (Debrecen) 6, 290–297 (1959)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: a recursive model for graph mining. In: SDM, vol. 4, pp. 442–446. SIAM (2004)Google Scholar
  18. 18.
    Kunegis, J.: KONECT: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343–1350. ACM (2013)Google Scholar
  19. 19.
    Albert, R., Jeong, H., Barabási, A.-L.: Internet: diameter of the world-wide web. Nature 401(6749), 130–131 (1999)CrossRefGoogle Scholar
  20. 20.
    Hawick, K., James, H.: Node importance ranking and scaling properties of some complex road networks (2007)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Computational Science and EngineeringGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations