Detecting and Analyzing Invariant Groups in Complex Networks

  • Dulal Mahata
  • Chanchal Patra
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 410)


Real-world complex networks usually exhibit inhomogeneity in functional properties, resulting in densely interconnected nodes, communities. Analyzing such communities in large networks has rapidly become a major area in network science. A major limitation of most of the community finding algorithms is the dependence on the ordering in which vertices are processed. However, less study has been conducted on the effect of vertex ordering in community detection. In this paper, we propose a novel algorithm, DIGMaP to identify the invariant groups of vertices which are not affected by vertex ordering. We validate our algorithm with the actual community structure and show that these detected groups are the core of the community.


Permamence DIGMaP Invariant community structure Complex network Community detection 


  1. 1.
    Newman, M.E.J.: Community detection and graph partitioning. CoRR abs/1305.4974 (2013)Google Scholar
  2. 2.
    Newman, M.E.J.: Modularity and community structure in networks. PNAS 103(23), 8577–8582 (2006)CrossRefGoogle Scholar
  3. 3.
    Blondel, V.D., Guillaume, J.L., Lambiotte, R., Mech. E.L.: Fast unfolding of communities in large networks. J. Stat. Mech. P10008 (2008)Google Scholar
  4. 4.
    Palla, G., Dernyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)CrossRefGoogle Scholar
  5. 5.
    Chakraborty, T., Srinivasan, S., Ganguly, N., Bhowmick, S., Mukherjee, A.: On the permanence of vertices in network communities. In: 20th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, New York city, pp. 1396–1405 (2014)Google Scholar
  6. 6.
    Psorakis, I., Roberts, S., Ebden, M., Sheldon, B.: Overlapping community detection using Bayesian non-negative matrix factorization. Phys. Rev. E 83(6), 066114 (2011)CrossRefGoogle Scholar
  7. 7.
    Ahn, Y.-Y., Bagrow, J.-P., Lehmann, S.: Link communities reveal multi-scale complexity in networks. Nature 466, 761–764 (2010)CrossRefGoogle Scholar
  8. 8.
    Pons, P., Latapy, M.: Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10(2), 191–218 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Rosvall, M., Bergstrom, C.T.: An information-theoretic framework for resolving community structure in complex networks. PNAS 104(18), 7327 (2007)CrossRefGoogle Scholar
  10. 10.
    Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76, 036106 (2007)CrossRefGoogle Scholar
  11. 11.
    Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. CoRR abs/1012.2363 (2010)Google Scholar
  12. 12.
    Xie, J., Szymanski, B.K.: Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm. CoRR abs/1105.3264 (2011)Google Scholar
  13. 13.
    Lancichinetti, A., Fortunato, A.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009)CrossRefGoogle Scholar
  14. 14.
    Delvenne, J.C., Yaliraki, S.N., Barahona, M.: Stability of graph communities across time scales. Proc. Natl. Acad. Sci. U.S.A. 107, 12755–12760 (2010)CrossRefGoogle Scholar
  15. 15.
    Chakraborty, T., Srinivasan, S., Ganguly, N., Bhowmick, S., Mukherjee, A.: Constant communities in complex networks. Nat. Sci. Reports 3(1825), (2013)Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceVidyasagar UniversityMidnapurIndia

Personalised recommendations