Detection of Communities in Social Networks Using Spanning Tree

  • Partha Basuchowdhuri
  • Siddhartha Anand
  • Diksha Roy Srivastava
  • Khusbu Mishra
  • Sanjoy Kumar Saha
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 28)


Communities are inherent substructures present in social networks. Yet finding communities from a social network can be a difficult task. Therefore, finding communities from a social network is an interesting problem. Also, due to its use in many practical applications, it is considered to be an important problem in social network analysis and is well-studied. In this paper, we propose a maximum spanning tree based method to detect communities from a social network. Experimental results show that this method can detect communities with high accuracy and with reasonably good efficiency compared to other existing community detection techniques.


Social Networks Community Detection Maximum Spanning Tree 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)CrossRefGoogle Scholar
  2. 2.
    Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. PNAS 101, 2658–2663 (2004)CrossRefGoogle Scholar
  3. 3.
    Girvan, M., Newman, M.: Community structure in social and biological networks. PNAS 99, 7821–7826 (2002)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Blondel, V., Guillaume, J., Lambiotte, R., Mech, E.: Fast unfolding of communities in large networks. J. Stat. Mech. (2008)Google Scholar
  5. 5.
    Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Physical Review E 70 (2004)Google Scholar
  6. 6.
    Chiang, M., Lam, H., Liu, Z., Poor, V.: Why steiner-tree type algorithms work for community detection. In: 16th International Conference on Artificial Intelligence and Statistics (AISTATS) (2013)Google Scholar
  7. 7.
    Lancichinetti, A., Fortunato, S.: Community detection algorithms: a comparative analysis (2009)Google Scholar
  8. 8.
    Dunn, G., Everitt, B.: An Introduction to Mathematical Taxonomy. Cambridge University Press (1982)Google Scholar
  9. 9.
    Holland, P., Leinhardt, S.: Transitivity in structural models of small groups. Small Group Research 2, 107–124 (1971)CrossRefGoogle Scholar
  10. 10.
    Prim, R.: Shortest connection networks and some generalizations. The Bell Systems Technical Journal 36, 1389–1401 (1957)CrossRefGoogle Scholar
  11. 11.
    Bastian, M., Heymann, S., Jacomy, M.: Gephi: An open source software for exploring and manipulating networks. In: ICWSM. The AAAI Press (2009)Google Scholar
  12. 12.
    Zachary, W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)Google Scholar
  13. 13.
    Girvan, M., Newman, M.: Community structure in social and biological networks. PNAS 99, 7821–7826 (2002)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Lusseau, D., Newman, M.: Identifying the role that animals play in their social networks. Proceedings of the Royal Society of London. Series B: Biological Sciences 271, S477–S481 (2004)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Partha Basuchowdhuri
    • 1
  • Siddhartha Anand
    • 1
  • Diksha Roy Srivastava
    • 1
  • Khusbu Mishra
    • 1
  • Sanjoy Kumar Saha
    • 2
  1. 1.Department of Computer Science and EngineeringHeritage Institute of TechnologyKolkataIndia
  2. 2.Department of Computer Science and EngineeringJadavpur UniversityKolkataIndia

Personalised recommendations