Asymptotic Modularity of Some Graph Classes
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.
KeywordsConnected Graph Maximum Degree Average Degree Graph Partitioning Graph Class
Unable to display preview. Download preview PDF.
- 3.Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(066133) (2004)Google Scholar
- 10.Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E 70, 066111 (2004)Google Scholar
- 11.Blondel, V., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment (2008)Google Scholar
- 13.DasGupta, B., Desai, D.: On the complexity of newman’s community finding approach for biological and social networks (2011), http://arxiv.org/abs/1102.0969
- 14.Karger, D., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proceedings of STOC, pp. 741–750. ACM (2002)Google Scholar