https://hal-enac.archives-ouvertes.fr/hal-00935207Cafieri, SoniaSoniaCafieriLIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau] - X - École polytechnique - CNRS - Centre National de la Recherche ScientifiqueHansen, PierrePierreHansenHEC Montréal - HEC MontréalLiberti, LeoLeoLibertiLIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau] - X - École polytechnique - CNRS - Centre National de la Recherche ScientifiqueEdge ratio and community structure in networksHAL CCSD2010[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]Porte, Laurence2014-04-15 15:01:092023-03-24 14:52:582014-04-15 16:27:49enJournal articleshttps://hal-enac.archives-ouvertes.fr/hal-00935207/document10.1103/PhysRevE.81.026105application/pdf1A hierarchical divisive algorithm is proposed for identifying communities in complex networks. To that effect, the definition of community in the weak sense of Radicchi et al. _Proc. Natl. Acad. Sci. U.S.A. 101, 2658 _2004__ is extended into a criterion for a bipartition to be optimal: one seeks to maximize the minimum for both classes of the bipartition of the ratio of inner edges to cut edges. A mathematical program is used within a dichotomous search to do this in an optimal way for each bipartition. This includes an exact solution of the problem of detecting indivisible communities. The resulting hierarchical divisive algorithm is compared with exact modularity maximization on both artificial and real world data sets. For two problems of the former kind optimal solutions are found; for five problems of the latter kind the edge ratio algorithm always appears to be competitive. Moreover, it provides additional information in several cases, notably through the use of the dendrogram summarizing the resolution. Finally, both algorithms are compared on reduced versions of the data sets of Girvan and Newman _Proc. Natl. Acad. Sci. U.S.A. 99, 7821 _2002__ and of Lancichinetti et al. _Phys. Rev. E 78, 046110 _2008__. Results for these instances appear to be comparable.