Community Detection Algorithm of the Large-Scale Complex Networks Based on Random Walk

  • Ding GuohuiEmail author
  • Song Huimin
  • Fan ChunlongEmail author
  • Song Yan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9998)


Community detection on large-scale complex networks has become a popularly discussed topic with the development of the social network. In this paper, we proposed a community detection algorithm based on the random walk theory. We assume each node has the energy value and the random walk process is considered as energy transfer. According to the transition probability matrix, nodes transfer energy in the network. We divide two nodes which transfer the most energy to each other into one community. The algorithm can obtain accurate division results on small data sets. However, when we applied it to the large-scale network, we find a problem that the sparse degree of matrix is reduced during the energy transfer process. We set the threshold to keep the energy matrix is still sparse in the process of transfer to solve this problem. We conduct extensive experiments on real-word large network provided by Stanford University and the results demonstrate the efficiency and effectiveness of our proposed algorithm.


Complex networks Random walk Power-law distribution Sparse matrix 



This research was supported by the National Natural Science Foundation of China (Grant No. 61303016).


  1. 1.
    Chengqi, Y., Bao Yuanyuan, X.: Social network data analysis framework and key technologies. ZTE Commun 01, 5–10 (2014)Google Scholar
  2. 2.
    Aewon Yang, J., Jure, L.: Defining and evaluating network communities based on ground-truth. Stanford University, cs.SI 6, November 2012Google Scholar
  3. 3.
    Tang, J., Chen, W.G.: Deep analytics and mining for big social data. Chin. Sci. Bull. 60, 509–519 (2015)CrossRefGoogle Scholar
  4. 4.
    Siganos, G., Faloutsos, M., Faloutsos, P., Christos, F.: Power laws and the AS-level internet topology. IEEE/ACM Trans. Netw. 11(4), 514–524 (2003)CrossRefGoogle Scholar
  5. 5.
    Di, J., Bo, Y., Jie, L., Liu Dayou, H.: Ant colony optimization based on random walk for community detection in complex networks. J. Softw. 03, 451–464 (2012)zbMATHGoogle Scholar
  6. 6.
    Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)CrossRefGoogle Scholar
  7. 7.
    Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. 69, 066133 (2004)Google Scholar
  8. 8.
    Fortunato, S.: Community detection in graphs complex networks and systems lagrange laboratory. ISI Foundation, Viale S. Severo 65 (2007)Google Scholar
  9. 9.
    Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: ICDM (2012)Google Scholar
  10. 10.
    Pons, P., Latapy, M.: Computing communities in large networks using random walks. In: Yolum, P., Güngör, T., Gürgen, F., Özturan, C. (eds.) ISCIS 2005. LNCS, vol. 3733, pp. 284–293. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Kardes, H., Sevincer, A., Gunes, M.H., Yuksel, M.: Six degrees of separation among US researchers. In: IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 654–659 (2012)Google Scholar
  12. 12.
    Ke, X.: A social networking services system based on the “Six Degrees of Separation” theory and damping factors. In: Second International Conference on Future Networks, pp. 438–441 (2010)Google Scholar
  13. 13.
    Jiajia, L., Xiuxia, Z., Guangming, T., Mingyu, C.: Study of choosing the optimal storage format of sparse matrix vector multiplication. J. Comput. Res. Dev. (2014)Google Scholar
  14. 14.
    Ferrara, E.: A Large-Scale Community Structure Analysis in Facebook. Springer, Heidelberg (2012)Google Scholar
  15. 15.
    Liu, C., Ye, J., Ma, Y.: Storage and solving of large sparse matrix linear equations. In: ICCIS, pp. 673–677 (2012)Google Scholar
  16. 16.
    Kernighan, B.W., Lin, S.: A efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291–307 (1970)CrossRefzbMATHGoogle Scholar
  17. 17.
    Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. In: Proceedings of National Academy of Sciences of the United States of America, pp. 7821–7826 (2002)Google Scholar
  18. 18.
    Yan, G., Chen, C., Lv, J., Fu, Z.Q.: Synchronization performance of complex oscillator networks. Phys. Rev. E, 80(5) (2009)Google Scholar
  19. 19.
    Lawrence, P., Sergey, B., Rajeev, M., Terry, W.: The PageRank Citation Ranking Bringing Order to the Web. Stanford Infolab, Stamford (1998)Google Scholar
  20. 20.
    Dongen, S.: Graph clustering by flow Simulation. Ph.D. thesis, University of Utrecht, Utrecht (2000)Google Scholar
  21. 21.
    Haijun, Z.: Network landscape from a Brownian particle’s perspective. Phys. Rev. E. 67(4), 041908 (2003)CrossRefGoogle Scholar
  22. 22.
    Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: SCAN: a structural clustering algorithm for networks. In: Berkhin, P. (ed.) Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 824–833. ACM, New York (2007)Google Scholar
  23. 23.
    Xianghua, F., Chao, W., Zhiqiang, W., Zhong, M.: Scalable community discovery based on threshold random walk. Comput. Inf. Syst. 8(21), 8953–8960 (2012)Google Scholar
  24. 24.
    Yueping, L., Weikun, Z.: New algorithm for detecting local community based on random walk. Telkomnika. 12(4), 1005–1016 (2015)Google Scholar
  25. 25.
    She, J., Tong, Y., Chen, L.: Utility-aware event-participant planning. In: Proceedings of the 34th ACM SIGMOD International Conference on Management of Data (SIGMOD 2015), pp. 1629–1643 (2015)Google Scholar
  26. 26.
    She, J., Tong, Y., Chen, L., Cao, C.C.: Conflict-aware event-participant arrangement. In: Proceedings of the 31st International Conference on Data Engineering (ICDE 2015), pp. 735–746 (2015)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Liaoning Provincial Key Laboratory of Large-Scale Distributed SystemShenyang Aerospace UniversityShenyangChina

Personalised recommendations