Skip to main content
Top

2016 | OriginalPaper | Chapter

Detecting and Analyzing Invariant Groups in Complex Networks

Authors : Dulal Mahata, Chanchal Patra

Published in: Computational Intelligence in Data Mining—Volume 1

Publisher: Springer India

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Newman, M.E.J.: Community detection and graph partitioning. CoRR abs/1305.4974 (2013) Newman, M.E.J.: Community detection and graph partitioning. CoRR abs/1305.4974 (2013)
2.
go back to reference Newman, M.E.J.: Modularity and community structure in networks. PNAS 103(23), 8577–8582 (2006)CrossRef Newman, M.E.J.: Modularity and community structure in networks. PNAS 103(23), 8577–8582 (2006)CrossRef
3.
go back to reference Blondel, V.D., Guillaume, J.L., Lambiotte, R., Mech. E.L.: Fast unfolding of communities in large networks. J. Stat. Mech. P10008 (2008) Blondel, V.D., Guillaume, J.L., Lambiotte, R., Mech. E.L.: Fast unfolding of communities in large networks. J. Stat. Mech. P10008 (2008)
4.
go back to reference 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)CrossRef 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)CrossRef
5.
go back to reference 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) 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)
6.
go back to reference Psorakis, I., Roberts, S., Ebden, M., Sheldon, B.: Overlapping community detection using Bayesian non-negative matrix factorization. Phys. Rev. E 83(6), 066114 (2011)CrossRef Psorakis, I., Roberts, S., Ebden, M., Sheldon, B.: Overlapping community detection using Bayesian non-negative matrix factorization. Phys. Rev. E 83(6), 066114 (2011)CrossRef
7.
go back to reference Ahn, Y.-Y., Bagrow, J.-P., Lehmann, S.: Link communities reveal multi-scale complexity in networks. Nature 466, 761–764 (2010)CrossRef Ahn, Y.-Y., Bagrow, J.-P., Lehmann, S.: Link communities reveal multi-scale complexity in networks. Nature 466, 761–764 (2010)CrossRef
8.
go back to reference Pons, P., Latapy, M.: Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10(2), 191–218 (2006)MathSciNetCrossRefMATH Pons, P., Latapy, M.: Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10(2), 191–218 (2006)MathSciNetCrossRefMATH
9.
go back to reference Rosvall, M., Bergstrom, C.T.: An information-theoretic framework for resolving community structure in complex networks. PNAS 104(18), 7327 (2007)CrossRef Rosvall, M., Bergstrom, C.T.: An information-theoretic framework for resolving community structure in complex networks. PNAS 104(18), 7327 (2007)CrossRef
10.
go back to reference 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)CrossRef 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)CrossRef
11.
go back to reference Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. CoRR abs/1012.2363 (2010) Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. CoRR abs/1012.2363 (2010)
12.
go back to reference Xie, J., Szymanski, B.K.: Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm. CoRR abs/1105.3264 (2011) Xie, J., Szymanski, B.K.: Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm. CoRR abs/1105.3264 (2011)
13.
go back to reference 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)CrossRef 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)CrossRef
14.
go back to reference 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)CrossRef 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)CrossRef
15.
go back to reference Chakraborty, T., Srinivasan, S., Ganguly, N., Bhowmick, S., Mukherjee, A.: Constant communities in complex networks. Nat. Sci. Reports 3(1825), (2013) Chakraborty, T., Srinivasan, S., Ganguly, N., Bhowmick, S., Mukherjee, A.: Constant communities in complex networks. Nat. Sci. Reports 3(1825), (2013)
Metadata
Title
Detecting and Analyzing Invariant Groups in Complex Networks
Authors
Dulal Mahata
Chanchal Patra
Copyright Year
2016
Publisher
Springer India
DOI
https://doi.org/10.1007/978-81-322-2734-2_9

Premium Partner