Modularity in random regular graphs and lattices.
Given a graph G, the modularity of a partition of the vertex set measures the extent to which edge density is higher within parts than between parts; and the modularity of G is the maximum modularity of a partition. We give an upper bound on the modularity of r-regular graphs as a function of the ed...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2013
|