Skip to Main content Skip to Navigation
Conference papers

Asymptotic Modularity of some Graph Classes

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Laurent Viennot Connect in order to contact the contributor
Submitted on : Tuesday, November 26, 2013 - 5:23:23 PM
Last modification on : Tuesday, January 11, 2022 - 11:16:22 AM
Long-term archiving on: : Thursday, February 27, 2014 - 10:56:05 AM


Files produced by the author(s)


  • HAL Id : hal-00909733, version 1


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⟩



Les métriques sont temporairement indisponibles