Loops and multiple edges in modularity maximization of networks.
The modularity maximization model proposed by Newman and Girvan for the identification of communities in networks works for general graphs possibly with loops and multiple edges. However, the applications usually correspond to simple graphs. These graphs are compared to a null model where the degree distribution is maintained but edges are placed at random. Therefore, in this null model there will be loops and possibly multiple edges. Sharp bounds on the expected number of loops, and their impact on the modularity, are derived. Then, building upon the work of Massen and Doye, but using algebra rather than simulation, we propose modified null models associated with graphs without loops but with multiple edges, graphs with loops but without multiple edges and graphs without loops nor multiple edges. We validate our models by using the exact algorithm for clique partitioning of Grötschel and Wakabayashi.
Cafieri
Sonia
S
Department Mathématiques et Informatique, Ecole Nationale de l'Aviation Civile, 7 av E Belin, F-31055 Toulouse, France. sonia.cafieri@enac.fr
Hansen
Pierre
P
Liberti
Leo
L
D000465:Algorithms; D000818:Animals; D008433:Mathematics; D008962:Models, Theoretical