Asymptotic Modularity of some Graph Classes

Fabien de Montgolfier (1, 2) , Mauricio Soto (1, 2) , Laurent Viennot (1, 2, 3)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 GANG - Networks, Graphs and Algorithms
3 LINCS - Laboratory of Information, Network and Communication Sciences

Modularity has been introduced as a quality measure for graph partitioning. It has received considerable attention in several disciplines, especially complex systems. In order to better understand this measure from a graph theoretical point of view, we study the modularity of a variety of graph classes. We first consider simple graph classes such as tori and hypercubes. We show that these regular graph families have asymptotic modularity 1 (that is the maximum possible). We extend this result to the general class of unit ball graphs of bounded growth metrics. Our most striking result concerns trees with bounded degree which also appear to have asymptotic modularity 1. This last result can be extended to graphs with constant average degree and to some power-law graphs.

Domaines: Réseaux et télécommunications [cs.NI]

Fabien de Montgolfier, Mauricio Soto, Laurent Viennot. Asymptotic Modularity of some Graph Classes. 22nd International Symposium on Algorithms and Computation (ISAAC), Dec 2011, Yokohama, Japan. pp.435-444. ⟨hal-00909733⟩