Journal of Systems Science and Complexity

, Volume 28, Issue 3, pp 517–545 | Cite as

Community detection with the weighted parsimony criterion

Article

Abstract

Community detection in networks has been studied extensively in the last decade. Many criteria, expressing the quality of the partitions obtained, as well as a few exact algorithms and a large number of heuristics have been proposed. The parsimony criterion consists in minimizing the number of edges added or removed from the given network in order to transform it into a set of disjoint cliques. Recently Zhang, Qiu and Zhang have proposed a weighted parsimony model in which a weight coefficient is introduced to balance the numbers of inserted and deleted edges. These authors propose rules to select a good value of the coefficient, use simulated annealing to find optimal or near-optimal solutions and solve a series of real and artificial instances. In the present paper, an algorithm is proposed for solving exactly the weighted parsimony problem for all values of the parameter. This algorithm is based on iteratively solving the problem for a set of given values of the parameter using a row generation algorithm. This procedure is combined with a search procedure to find all lowest breakpoints of the value curve (i.e., the weighted sum of inserted and deleted edges). Computational results on a series of artificial and real world networks from the literature are reported. It appears that several partitions for the same network may be informative and that the set of solutions usually contains at least one intuitively appealing partition.

Keywords

Community detection complex networks parsimony 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Newman ME J and Girvan M, Finding and evaluating community structure in networks, Physical Review E, 2004, 69: 026113.CrossRefGoogle Scholar
  2. [2]
    Cafieri S, Hansen P, and Liberti L, Loops and multiple edges in modularity maximization of networks, Physical Review E, 2010, 81(4): 46102.CrossRefMathSciNetGoogle Scholar
  3. [3]
    Fortunato S and Barthelemy M, Resolution limit in community detection, PNAS USA, 2007, 104: 36.CrossRefGoogle Scholar
  4. [4]
    Good B H, De Montjoye Y A, and Clauset A. Performance of modularity maximization in practical contexts, Physical Review E, 2010, 81(4): 046106.CrossRefMathSciNetGoogle Scholar
  5. [5]
    Massen C P and Doye J P K, Identifying communities within energy landscapes, Physical Review E, 2005, 71: 046101.CrossRefMathSciNetGoogle Scholar
  6. [6]
    Dahlhaus E, Johnson D S, Papadimitriou C H, Seymour P D, and Yannakakis M, The complexity of multiterminal cuts, SIAM Journal on Computing, 1994, 23: 864–894.CrossRefMATHMathSciNetGoogle Scholar
  7. [7]
    Grötschel M and Wakabayashi Y, A cutting plane algorithm for a clustering problem, Mathematical Programming B, 1989, 45: 59–96.CrossRefMATHGoogle Scholar
  8. [8]
    Zhang J, Qiu Y, and Zhang X S, Detecting community structure: From parsimony to weighted parsimony, Journal of Systems Science and Complexity, 2010, 23(5): 1024–1036.CrossRefMATHMathSciNetGoogle Scholar
  9. [9]
    Li Z, Zhang S, WAng R S, Zhang X S, and Chen L. Quantitative function for community detection. Physical Review E, 2008, 77: 036109.CrossRefGoogle Scholar
  10. [10]
    Bettinelli A, Hansen P, and Liberti L, Algorithm for parametric community detection in networks, Physical Review E, 2012, 86: 016107.CrossRefGoogle Scholar
  11. [11]
    Grötschel M and Wakabayashi Y, Facets of the clique partitioning polytope, Mathematical Programming, 1990, 47: 367–387.CrossRefMATHMathSciNetGoogle Scholar
  12. [12]
    Dantzig G B, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.MATHGoogle Scholar
  13. [13]
    Arenas A, Fernàndez A, and Gòmez S, Analysis of the structure of complex networks at different resolution levels, New Journal of Physics, 2008, 10: 053039.CrossRefGoogle Scholar
  14. [14]
    Reichardt J and Bornholdt S, Statistical mechanics of community detection, Physical Review E, 2006, 74: 016110.CrossRefMathSciNetGoogle Scholar
  15. [15]
    Zachary W, Journal of Anthropological Research, 1977, 33: 452.Google Scholar
  16. [16]
    Lancichinetti A, Fortunato S, and Radicchi F, Benchmark graphs for testing community detection algorithms, Physical Review E, 2008, 78: 046110.CrossRefGoogle Scholar
  17. [17]
    Zhang S, Wang R S, and Zhang X S, Identification of overlapping community structure in complex networks using fuzzy c-means clustering, Physica A, 2007, 374: 483–490.CrossRefGoogle Scholar
  18. [18]
    Zhang S, Wang R S, and Zhang X S, Uncovering fuzzy community structure in complex networks, Physical Review E, 2007, 76: 046103.CrossRefGoogle Scholar
  19. [19]
    Girvan M and Newman M E J, Community structure in social and biological networks, Proc. Natl. Acad. Sci., 2002, 99: 7821–7826.CrossRefMATHMathSciNetGoogle Scholar
  20. [20]
    Lusseau D, Schneider K, Boisseau O J, Haase P, Slooten E, and Dawson S M, The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations, Behavioral Ecology and Sociobiology, 2003, 54: 396–405.CrossRefGoogle Scholar
  21. [21]
    Aloise D, Cafieri S, Caporossi G, Hansen P, Liberti L, and Perron S, Column generation algorithms for exact modularity maximization in networks, Physical Review E, 2010, 82: 046112.CrossRefGoogle Scholar
  22. [22]
    Lorenzini D and Tucker T J, The equations and the method of Chabauty-Coleman, Invent. Math., 2002, 148: 1–46.CrossRefMathSciNetGoogle Scholar

Copyright information

© Institute of Systems Science, Academy of Mathematics and Systems Science, CAS and Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Andrea Bettinelli
    • 1
  • Pierre Hansen
    • 2
    • 3
  • Leo Liberti
    • 4
  1. 1.Dipartimento di Ingegneria dell’Energia Elettrica e Dell’InformazioneUniversità di BolognaBolognaItaly
  2. 2.Groupe d’études et de Recherche en Analyse des DécisionsHautes Études CommercialesMontréalCanada
  3. 3.École PolytechniqueLIXPalaiseauFrance
  4. 4.Ecole PolytechniqueCNRS LIXPalaiseauFrance

Personalised recommendations