Communication Dynamics of Blog Networks

  • Mark Goldberg
  • Stephen Kelley
  • Malik Magdon-Ismail
  • Konstantin Mertsalov
  • William (Al) Wallace
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5498)


We study the communication dynamics of Blog networks, focusing on the Russian section of LiveJournal as a case study. Communication (blogger-to-blogger links) in such online communication networks is very dynamic: over 60% of the links in the network are new from one week to the next, though the set of bloggers remains approximately constant. Two fundamental questions are: (i) what models adequately describe such dynamic communication behavior; and (ii) how does one detect the phase transitions, i.e. the changes that go beyond the standard high-level dynamics? We approach these questions through the notion of stable statistics. We give strong experimental evidence to the fact that, despite the extreme amount of communication dynamics, several aggregate statistics are remarkably stable. We use stable statistics to test our models of communication dynamics postulating that any good model should produce values for these statistics which are both stable and close to the observed ones. Stable statistics can also be used to identify phase transitions, since any change in a normally stable statistic indicates a substantial change in the nature of the communication dynamics. We describe models of the communication dynamics in large social networks based on the principle of locality of communication: a node’s communication energy is spent mostly within its own ”social area,” the locality of the node.


Random Graph Communication Dynamic Preferential Attachment Giant Component Communication Energy 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albert, R., Barabási, A.-L.: Statictical mechanics of complex networks. Reviews of Modern Physics 74(47-97) (2002)Google Scholar
  2. 2.
    Barabási, A.L., Jeong, J., Nëda, Z., Ravasz, E., Shubert, A., Vicsek, T.: Evolution of the social network of scientific collaborations. Physica A 311(590-614) (2002)Google Scholar
  3. 3.
    Baumes, J., Chen, H.-C., Francisco, M., Goldberg, M., Magdon-Ismail, M., Wallace, W.: Dynamics of bridging and bonding in social groups, a multi-agent model. In: Third conference of the North American Association for Computational Social and Organizational Science (NAACSOS 2005), Notre-Dame, Indiana, June 26-28 (2005)Google Scholar
  4. 4.
    Baumes, J., Goldberg, M., Krishnamoorthy, M., Magdon-Ismail, M., Preston, N.: Finding comminities by clustering a graph into overlapping subgraphs. In: Proceedings of IADIS International Conference, Applied Computing 2005, pp. 97–104 (2005)Google Scholar
  5. 5.
    Baumes, J., Goldberg, M., Magdon-Ismail, M.: Efficient identification of overlapping communities. In: IEEE International Conference on Intelligence and Security Informatics (ISI), May 2005, pp. 27–36 (2005)Google Scholar
  6. 6.
    Baumes, J., Goldberg, M., Magdon-Ismail, M., Wallace, W.: Identification of hidden groups in communications. In: Handbooks in Information Systems, National Security, vol. 2 (2007)Google Scholar
  7. 7.
    Berger-Wolf, T.Y., Saia, J.: A framework for analysis of dynamic social networks. DIMACS Technical Report 28 (2005)Google Scholar
  8. 8.
    Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stat, R., Tomkins, A., Wiener, J.: Graph structure in the web. Computer Networks 33(1-6), 309–320 (2000)CrossRefGoogle Scholar
  9. 9.
    Chung, F., Lu, L.: Connected components in random graphs with given degree sequence. Annals of Combinatoreics 6, 125–1456 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Clauset, A., Shalizi, C.R., Newman, M.E.J.: Power-law distributions in empirical data (2007)Google Scholar
  11. 11.
    Doreian, P., Stokman, E.F.N.: Evolution of social networks. Gordon and Breach (1997)Google Scholar
  12. 12.
    Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM, pp. 251–252 (1999)Google Scholar
  13. 13.
    Gkantsidi, C., Mihail, M., Zegura, E.: The markov chain simulatiopn methods for generating connected power law random graphs. In: Proc. of ALENEX 2003, pp. 16–50 (2003)Google Scholar
  14. 14.
    Goh, K.-I., Eom, Y.-H., Jeong, H., Kahng, B., Kim, D.: Structure and evolution of online social relationships: Heterogeneity in unrestricted discussions. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics) 73(6), 66123 (2006)Google Scholar
  15. 15.
    Goldberg, M., Kelley, S., Magdon-Ismail, M., Mertsalov, K.: A locality model for the evolution of blog networks. In: IEEE Information and Security Informatics, ISI (2008)Google Scholar
  16. 16.
    Goldberg, M., Kelley, S., Magdon-Ismail, M., Mertsalov, K.: Stable statistics of the blogograph. In: Interdisciplinary Studies in Information Privacy and Security (2008)Google Scholar
  17. 17.
    Kleinberg, J.M., Lawrence, S.: The structure of the web. Science, 1849–1850 (2001)Google Scholar
  18. 18.
    Kossinets, G., Watts, D.J.: Empirical analysis of an evolving social network. Science 311, 88–90 (2006)CrossRefMathSciNetGoogle Scholar
  19. 19.
    Kumar, R., Novak, J., Raghavan, P., Tomkins, A.: Structure and evolution of blogospace. Communications of the ACM 33(1-6), 309–320 (2004)Google Scholar
  20. 20.
    Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of online social networks. In: KDD 2006 (2006)Google Scholar
  21. 21.
    Newman, M.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Newman, M., Barabási, A.-L., Watts, D.: The structure and dynamics of networks. Princeton University Press, Princeton (2006)zbMATHGoogle Scholar
  23. 23.
    Newman, M.E.J.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. USA 98, 404 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Stauffer, A.O., Barbosa, V.C.: A study of the edge-switching markov chain method for the generation of random graphs. arxiv: cs. DM/0512105 (2006)Google Scholar
  25. 25.
    West, D.B.: Introduction to graph theory. Prentice Hall, Upper Saddle River (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Mark Goldberg
    • 1
  • Stephen Kelley
    • 1
  • Malik Magdon-Ismail
    • 1
  • Konstantin Mertsalov
    • 1
  • William (Al) Wallace
    • 2
  1. 1.CS DepartmentRPITroy
  2. 2.DSES DepartmentRPITroy

Personalised recommendations