skip to main content
10.1145/2908812.2908878acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Game theory, Extremal optimization, and Community Structure Detection in Complex Networks

Published: 20 July 2016 Publication History

Abstract

The network community detection problem consists in identifying groups of nodes that are more densely connected to each other than to the rest of the network. The lack of a formal definition for the notion of community led to the design of various solution concepts and computational approaches to this problem, among which those based on optimization and, more recently, on game theory, received a special attention from the heuristic community. The former ones define the community structure as an optimum value of a fitness function, while the latter as a game equilibrium. Both are appealing as they allowed the design and use of various heuristics. This paper analyses the behavior of such a heuristic that is based on extremal optimization, when used either as an optimizer or within a game theoretic setting. Numerical results, while significantly better than those provided by other state-of-art methods, for some networks show that differences between tested scenarios do not indicate any superior behavior when using game theoretic concepts; moreover, those obtained without using any selection for survival suggest that the search is actually guided by the inner mechanism of the extremal optimization method and by the fitness function used to evaluate and compare components within an individual.

References

[1]
V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10):P10008, 2008.
[2]
S. Boettcher and A. G. Percus. Optimization with Extremal Dynamics. Physical Review Letters, 86:5211--5214, June 2001.
[3]
S. Boettcher and A. G. Percus. Extremal optimization: an evolutionary local-search algorithm. CoRR, cs.NE/0209030, 2002.
[4]
S. Fortunato. Community detection in graphs. Physics Reports, 486:75 -- 174, 2010.
[5]
S. Fortunato and M. Barthelemy. Resolution limit in community detection. Proceedings of the National Academy of Sciences, 104(1):36--41, 2007.
[6]
M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12):7821--7826, June 2002.
[7]
A. Lancichinetti, S. Fortunato, and J. Kertész. Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics, 11(3):033015, 2009.
[8]
A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato. Finding statistically significant communities in networks. PloS one, 6(4):e18961, 2011.
[9]
Z. Li, S. Zhang, R.-S. Wang, X.-S. Zhang, and L. Chen. Quantitative function for community detection. Phys. Rev. E, 77:036109, Mar 2008.
[10]
R. Lung, M. Suciu, and N. Gasko. Noisy extremal optimization. Soft Computing, pages 1--18, 2015.
[11]
R. I. Lung, C. Chira, and A. Andreica. Game Theory and Extremal Optimization for Community Detection in Complex Dynamic Networks. PLOS ONE, 9(2), 2014.
[12]
R. I. Lung, C. Chira, and A. Andreica. Game theory and extremal optimization for community detection in complex dynamic networks. PloS one, 9(2):e86891, Jan. 2014.
[13]
R. I. Lung and D. Dumitrescu. Computing nash equilibria by means of evolutionary computation. Int. J. of Computers, Communications & Control, III(suppl.issue):364--368, 2008.
[14]
R. I. Lung, M. Suciu, N. Gaskó, and D. Dumitrescu. Characterization and detection of ?-berge-zhukovskii equilibria. PloS one, 10(7):e0131983, 2015.
[15]
D. Lusseau, K. Schneider, O. Boisseau, P. Haase, E. Slooten, and S. Dawson. The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology, 54(4):396--405, 2003.
[16]
M. E. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004.
[17]
M. E. J. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23):8577--8582, 2006.
[18]
C. Pizzuti. Ga-net: A genetic algorithm for community detection in social networks. In Parallel Problem Solving from Nature--PPSN X, pages 1081--1090. Springer, 2008.
[19]
M. Rosvall and C. T. Bergstrom. Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences, 105(4):1118--1123, 2008.
[20]
M. Sales-Pardo, R. Guimerà, A. A. Moreira, and L. A. N. Amaral. Extracting the hierarchical organization of complex systems. Proceedings of the National Academy of Sciences, 104(39):15224--15229, Sept. 2007.
[21]
M. Suciu, R. I. Lung, and N. Gaskó. Mixing Network Extremal Optimization for Community Structure Detection, volume 9026 of Lecture Notes in Computer Science. Springer International Publishing, Cham, 2015.
[22]
J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. In Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, MDS '12, pages 3:1--3:8, New York, NY, USA, 2012. ACM.
[23]
W. W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33(4):452--473, 1977.
[24]
V. Zhukovskii and A. A. Chikrii. Linear quadratic differential games. Naoukova Doumka, Kiev, 1994.

Cited By

View all
  • (2017)A game-theoretic approach for non-overlapping communities detection2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC)10.1109/IWCMC.2017.7986475(1315-1320)Online publication date: Jun-2017
  • (2017)Community Detection in Bipartite Networks Using a Noisy Extremal Optimization AlgorithmIntelligent Systems Design and Applications10.1007/978-3-319-53480-0_86(871-878)Online publication date: 23-Feb-2017

Index Terms

  1. Game theory, Extremal optimization, and Community Structure Detection in Complex Networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016
    July 2016
    1196 pages
    ISBN:9781450342063
    DOI:10.1145/2908812
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 20 July 2016

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. extremal optimization
    2. game theory
    3. network community structure

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    GECCO '16
    Sponsor:
    GECCO '16: Genetic and Evolutionary Computation Conference
    July 20 - 24, 2016
    Colorado, Denver, USA

    Acceptance Rates

    GECCO '16 Paper Acceptance Rate 137 of 381 submissions, 36%;
    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)4
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 16 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2017)A game-theoretic approach for non-overlapping communities detection2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC)10.1109/IWCMC.2017.7986475(1315-1320)Online publication date: Jun-2017
    • (2017)Community Detection in Bipartite Networks Using a Noisy Extremal Optimization AlgorithmIntelligent Systems Design and Applications10.1007/978-3-319-53480-0_86(871-878)Online publication date: 23-Feb-2017

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media