Community Detection Based on Minimum-Cut Graph Partitioning

  • Yashen WangEmail author
  • Heyan Huang
  • Chong Feng
  • Zhirun Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9098)


One of the most useful measurements of community detection quality is the modularity, which evaluates how a given division deviates from an expected random graph. This article demonstrates that (i) modularity maximization can be transformed into versions of the standard minimum-cut graph partitioning, and (ii) normalized version of modularity maximization is identical to normalized cut graph partitioning. Meanwhile, we innovatively combine the modularity theory with popular statistical inference method in two aspects: (i) transforming such statistical model into null model in modularity maximization; (ii) adapting the objective function of statistical inference method for our optimization. Based on the demonstrations above, this paper proposes an efficient algorithm for community detection by adapting the Laplacian spectral partitioning algorithm. The experiments, in both real-world and synthetic networks, show that both the quality and the running time of the proposed algorithm rival the previous best algorithms.


Community detection Modularity Minimum-cut 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Physical Review E. 69(2), 026113 (2004)CrossRefGoogle Scholar
  2. 2.
    Fortunato, S.: Community detection in graphs. Physics Reports. 486(3), 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Zhou, T.C., Ma, H., Lyu, M.R., King, I.: User-rec: a user recommendation framework in social tagging systems. In: Proceedings of 24th AAAI Conference on Artificial Intelligence, pp. 1486–1491. AAAI Press, Atlanta (2010)Google Scholar
  4. 4.
    Weng, J., Lee, B.S.: Event detection in twitter. In: Proceedings of 5th International AAAI Conference on Weblogs and Social Media, pp. 401–408. AAAI Press, Barcelona (2011)Google Scholar
  5. 5.
    Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in Social Media. Data Mining and Knowledge Discovery 24(3), 515–554 (2011)CrossRefGoogle Scholar
  6. 6.
    Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Physical Review E. 70(6), 066111 (2004)CrossRefGoogle Scholar
  7. 7.
    Newman, M.E.J.: Community detection and graph partitioning. EPL (Europhysics Letters). 103(2), 28003 (2013)CrossRefGoogle Scholar
  8. 8.
    Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing 20(1), 359–392 (1998)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Condon, A., Karp, R.M.: Algorithms for Graph Partitioning on the Planted Partition Model. Random Structures and Algorithms. 18(2), 116–140 (2001)zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Lancichinetti, A., Fortunato, S.: Community detection algorithms: A comparative analysis. Physical Review E. 80, 056117 (2009)CrossRefGoogle Scholar
  11. 11.
    Karrer, B., Newman, M.E.J.: Stochastic blockmodels and community structure in networks. Physical Review E. 83(1), 016107 (2011)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Physical Review E. 74(3), 036104 (2006)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Fjallstrom, P.: Algorithms for Graph Partitioning: A Survey. Linkoping Electronic Articles in Computer and Information Science. 3(10) (1998)Google Scholar
  14. 14.
    Newman, M.E.: Modularity and community structure in networks. Proceedings of the National Academy of Sciences 103(23), 8577–8582 (2006)CrossRefGoogle Scholar
  15. 15.
    Fiedler, M.: Algebraic Connectivity of Graphs. Czechoslovak Mathematical Journal 23(98), 298–305 (1973)MathSciNetGoogle Scholar
  16. 16.
    White, S., Smyth, P.: A spectral approach to find communities in graphs. Proceedings of SIAM Conf. on Data Mining 5, 76–84 (2005)Google Scholar
  17. 17.
    Erdös, P., Renyi, A.: On Random Graphs. Publ. Math. 6, 290–297 (1959)zbMATHGoogle Scholar
  18. 18.
    Chung, F., Lu, L.: Connected Components in Random Graphs with Given Expected Degree Sequences. Annals of Combinatorics. 6(2), 125–145 (2002)zbMATHMathSciNetCrossRefGoogle Scholar
  19. 19.
    Fred, A.L.N., Jain, A.K.: Robust data clustering. In: Proceedings of 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition II, pp. 128–133. IEEE Press, Madison, Wisconsin, USA (2003)Google Scholar
  20. 20.
    Zachary, W.W.: An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research. 33(4), 452–473 (1977)Google Scholar
  21. 21.
    Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology. 54, 396–405 (2003)CrossRefGoogle Scholar
  22. 22.
    Adamic, L.A., Glance, N.: The political blogosphere and the 2004 U.S. election. In: Proceedings of 3rd International Workshop on Link Discovery, pp. 36–43. ACM Press, New York (2005)Google Scholar
  23. 23.
    Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Physical Review E. 78, 046110 (2008)CrossRefGoogle Scholar
  24. 24.
    Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proceedings of the National Academy of Sciences of the United States of America 99(25), 15879–15882 (2002)zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Yashen Wang
    • 1
    Email author
  • Heyan Huang
    • 1
  • Chong Feng
    • 1
  • Zhirun Liu
    • 1
  1. 1.Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications, School of ComputerBeijing Institute of TechnologyBeijingChina

Personalised recommendations