Analyzing the Propagation of Influence and Concept Evolution in Enterprise Social Networks through Centrality and Latent Semantic Analysis

  • Weizhong Zhu
  • Chaomei Chen
  • Robert B. Allen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5012)


Understanding the propagation of influence and the concept flow over a network in general has profound theoretical and practical implications. In this paper, we propose a novel approach to ranking individual members of a real-world communication network in terms of their roles in such propagation processes. We first improve the accuracy of the centrality measures by incorporating temporal attributes. Then, we integrate weighted PageRank and centrality scores to further improve the quality of these measures. We valid these ranking measures through a study of an email archive of a W3C working group against an independent list of experts. The results show that time-sensitive Degree, time-sensitive Betweenness and the integration of the weighted PageRank and these centrality measures yield the best ranking results. Our approach partially solves the rank sink problem of PageRank by adjusting flexible jumping probabilities with Betweenness centrality scores. Finally the text analysis based on Latent Semantic Indexing extracts key concepts distributed in different time frames and explores the evolution of the discussion topics in the social network. The overall study depicts an overview of the roles of the actors and conceptual evolution in the social network. These findings are important to understand the dynamics of the social networks.


Betweenness Centrality Weighted PageRank Social Network Analysis Time Series Analysis Latent Semantic Indexing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Batagelj, V., Mrvar, A.: Pajek - Analysis and Visualization of Large Networks. In: Jünger, M., Mutzel, P. (eds.) Graph Drawing Software, Springer, Berlin (2003)Google Scholar
  2. 2.
    Bollen, J., Rodriguez, M.A., Van de Sompel, H.: Journal status. ArXiv, January 9 (2006)Google Scholar
  3. 3.
    Bonacich, P.: Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology 2, 113–120 (1972)Google Scholar
  4. 4.
    Borgatti, S.P.: Centrality and network flow. Social Networks 27, 55–77 (2005)CrossRefGoogle Scholar
  5. 5.
    Brandes, U.: A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25(2), 163–177 (2001)MATHGoogle Scholar
  6. 6.
    Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks 30(1-7), 107–117 (1998)Google Scholar
  7. 7.
    Faloutsos, C., McCurley, K., Tomkins, A.: Fast discovery of connection subgraphs. In: ACM SIGKDD, pp. 118–127 (2004)Google Scholar
  8. 8.
    Freeman, L.C.: A set of measures of centrality based on Betweenness. Sociometry 40, 35–41 (1997)CrossRefGoogle Scholar
  9. 9.
    Freeman, L.C.: Centrality in social networks: Conceptual clarification. Social Networks 1, 215–239 (1979)CrossRefGoogle Scholar
  10. 10.
    Friedkin, N.E.: Theoretical foundations for centrality measures. American Journal of Sociology, 1478–1504 (1991)Google Scholar
  11. 11.
    Pujol, J.M., Sangüesa, R., Delgado, J.: Extracting reputation in multi agent systems by means of social network topology. In: Proceedings of the first international joint conference on Autonomous agents and multi-agent systems, pp. 467–474 (2002)Google Scholar
  12. 12.
    Kleinberg, J.: Authoritative sources in a hyperlinked environment. Journal of ACM 46, 604–632 (1999)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Huberman, B., Wu, F.: Finding communities in linear time: a physics approach. The European Physical Journal B - Condensed Matter 38(2), 331–338 (2004)CrossRefGoogle Scholar
  14. 14.
    Newman, M.: Who is the best connected scientist? A study of scientific co-authorship networks. In: Ben-Naim, E., Frauenfelder, H., Toroczkai, Z. (eds.) Complex Networks, pp. 337–370. Springer, Heidelberg (2004)Google Scholar
  15. 15.
    Nobel, C., Cook, D.J.: Graph-based anomaly detection. In: ACM SIGKDD, pp. 631–636 (2003)Google Scholar
  16. 16.
    Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the Web. Technical report, Stanford Digital Library Technologies Project (1998)Google Scholar
  17. 17.
    Sabidussi, G.: The centrality index of a graph. Psychometrika 31, 581–603 (1966)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Shetty, J., Adibi, J.: Discovering important nodes through graph entropy: The case of Enron email database. In: ACM SIGKDD (2005)Google Scholar
  19. 19.
    Watts, D.: Six degrees: The science of a connected age. Norton, New York (2003)Google Scholar
  20. 20.
    White, S., Smyth, P.: Algorithms for estimating relative importance in networks. In: ACM SIGKDD, pp. 266–275 (2003)Google Scholar
  21. 21.
    Freeman, L.C., Borgatti, S.P., White, D.R.: Centrality in valued graphs: A measure of Betweenness based on network flow. Social Networks 13, 141–154 (1991)CrossRefMathSciNetGoogle Scholar
  22. 22.
    Latora, V., Marchiori, M.: cond-mat/0402050 Google Scholar
  23. 23.
    Newman, M.E.J.: A measure of Betweenness centrality based on random walks, arXiv:cond-mat/0309045 v1 (2003)Google Scholar
  24. 24.
    Zhu, W., Chen, C.: Storylines: Visual exploration and analysis in latent semantic spaces. International Journal of Computers and Graphics. Special Issue on Visual Analytics 31(3), 338–349 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Weizhong Zhu
    • 1
  • Chaomei Chen
    • 1
  • Robert B. Allen
    • 1
  1. 1.College of Information Science and TechnologyDrexel UniversityPhiladelphiaUSA

Personalised recommendations