Skip to main content
SpringerLink
Log in

About Nash Equilibrium, Modularity Optimization, and Network Community Structure Detection

  • Conference paper
  • First Online:
International Joint Conference SOCO’17-CISIS’17-ICEUTE’17 León, Spain, September 6–8, 2017, Proceeding (SOCO 2017, ICEUTE 2017, CISIS 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 649))

Abstract

The concept of community in complex networks, which is intuitively expressed as a group of nodes more densely connected to each other than to the rest of the network, has not been formally defined yet in a manner that encompasses all aspect ensuing from this intuitive description. Among existing approaches, a popular one consists in considering the network community structure as the optimum value of a fitness function that reflects the modularity of the network. Recently, a new trend to model the problem as a game having the community structure as equilibrium has emerged. Both approaches are appealing as they allow the design of heuristic approaches to this problem and benefit from their adaptability and scalability. This paper analyzes the behavior of such a heuristic that is based on extremal optimization in combination with two possible game theoretic models that consider different payoff functions, in comparison with the corresponding optimization approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Using the source code available at https://sites.google.com/site/andrealancichinetti/ software, last accessed May, 2015.

  2. 2.

    https://sites.google.com/site/andrealancichinetti/software, last accessed May, 2015.

  3. 3.

    http://www.orgnet.com, last accessed 9/3/2015.

References

  1. Alvari, H., Hajibagheri, A., Sukthankar, G.: Community detection in dynamic social networks: a game-theoretic approach. In: 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014), pp. 101–107. IEEE, August 2014

    Google Scholar 

  2. Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 2008(10), P10008 (2008)

    Article  Google Scholar 

  3. Boettcher, S., Percus, A.G.: Optimization with extremal dynamics. Phys. Rev. Lett. 86, 5211–5214 (2001)

    Google Scholar 

  4. Boettcher, S., Percus, A.G.: Extremal optimization: an evolutionary local-search algorithm. CoRR cs.NE/0209030 (2002)

    Google Scholar 

  5. Chen, W., Liu, Z., Sun, X., Wang, Y.: A game-theoretic framework to identify overlapping communities in social networks. Data Min. Knowl. Disc. 21(2), 224–240 (2010)

    Google Scholar 

  6. Duch, J., Arenas, A.: Community detection in complex networks using extremal optimization. Phys. Rev. E 72, 027104 (2005)

    Google Scholar 

  7. Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  8. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002)

    Google Scholar 

  9. Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)

    Article  Google Scholar 

  10. Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PloS one 6(4), e18961 (2011)

    Article  Google Scholar 

  11. Lung, R.I., Dumitrescu, D.: Computing nash equilibria by means of evolutionary computation. Int. J. Comput. Commun. Control III(suppl.issue), 364–368 (2008)

    Google Scholar 

  12. Lung, R.I., Gog, A., Chira, C.: A game theoretic approach to community detection in social networks. In: Nature Inspired Cooperative Strategies for Optimization, NICSO 2011, Cluj-Napoca, Romania, 20–22 October 2011, pp. 121–131 (2011)

    Google Scholar 

  13. Lung, R.I., Suciu, M., Gaskó, N.: Noisy extremal optimization. Soft Comput. 21(5), 1253–1270 (2017)

    Article  Google Scholar 

  14. Lusseau, D., Schneider, K., Boisseau, O., Haase, P., Slooten, E., Dawson, S.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396–405 (2003)

    Article  Google Scholar 

  15. Mandala, S., Kumara, S., Chatterjee, K.: A game-theoretic approach to graph clustering. INFORMS J. Comput. 26(3), 629–643 (2014)

    Google Scholar 

  16. McSweeney, P.J., Mehrotra, K., Oh, J.C.: A game theoretic framework for community detection. In: 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 227–234. IEEE, August 2012

    Google Scholar 

  17. Narayanam, R., Narahari, Y.: A game theory inspired, decentralized, local information based algorithm for community detection in social graphs. In: Proceedings - International Conference on Pattern Recognition, pp. 1072–1075 (2012)

    Google Scholar 

  18. Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)

    Article  Google Scholar 

  19. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)

    Article  Google Scholar 

  20. Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105(4), 1118–1123 (2008)

    Article  Google Scholar 

  21. Sales-Pardo, M., Guimerà, R., Moreira, A.A., Amaral, L.A.N.: Extracting the hierarchical organization of complex systems. Proc. Natl. Acad. Sci. 104(39), 15224–15229 (2007)

    Google Scholar 

  22. Suciu, M., Lung, R.I., Gaskó, N.: Mixing network extremal optimization for community structure detection. In: Lecture Notes in Computer Science, vol. 9026. Springer, Cham (2015)

    Google Scholar 

  23. Sung, Y.S., Kumara, S.: Detecting overlapping communities in online social networks using game theoretic approach. In: IIE Annual Conference and Expo 2013. Institute of Industrial Engineers, pp. 77–86 (2013)

    Google Scholar 

  24. Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, MDS 2012, pp. 3:1–3:8. ACM, New York (2012)

    Google Scholar 

  25. Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452–473 (1977)

    Article  Google Scholar 

  26. Zhou, L., Cheng, C., Lü, K., Chen, H.: Using coalitional games to detect communities in social networks. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7923, pp. 326–331 (2013)

    Google Scholar 

Download references

Acknowledgment

This work was supported by a grant of the Romanian National Authority for Scientific Research and Innovation, CNCS - UEFISCDI, project number PN-II-RU-TE-2014-4-2332.

Author information

Authors and Affiliations

  1. Center for the Study of Complexity, Babeş-Bolyai University of Cluj Napoca, Cluj-Napoca, Romania

    Rodica Ioana Lung, Mihai Alexandru Suciu & Noémi Gaskó

Authors
  1. Rodica Ioana Lung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mihai Alexandru Suciu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Noémi Gaskó
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rodica Ioana Lung .

Editor information

Editors and Affiliations

  1. University of Leon, Leon, Spain

    Hilde Pérez García

  2. University of Leon, Leon, Spain

    Javier Alfonso-Cendón

  3. University of Leon, Leon, Spain

    Lidia Sánchez González

  4. Department of Industrial Engineering, University of A Coruña, Ferrol, Spain

    Héctor Quintián

  5. University of Salamanca, Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Lung, R.I., Suciu, M.A., Gaskó, N. (2018). About Nash Equilibrium, Modularity Optimization, and Network Community Structure Detection. In: Pérez García, H., Alfonso-Cendón, J., Sánchez González, L., Quintián, H., Corchado, E. (eds) International Joint Conference SOCO’17-CISIS’17-ICEUTE’17 León, Spain, September 6–8, 2017, Proceeding. SOCO ICEUTE CISIS 2017 2017 2017. Advances in Intelligent Systems and Computing, vol 649. Springer, Cham. https://doi.org/10.1007/978-3-319-67180-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67180-2_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67179-6

  • Online ISBN: 978-3-319-67180-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation