Name
Abstract | ||
|---|---|---|
Clustering algorithms for large networks typically use modularity values to test which partitions of the vertex set better represent structure in the data. The modularity of a graph is the maximum modularity of a partition. We consider the modularity of two kinds of graphs. For r-regular graphs with a given number of vertices, we investigate the minimum possible modularity, the typical modularity,... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1093/comnet/cnx046 | Journal of Complex Networks |
Keywords | Field | DocType |
community detection,Newman–Girvan modularity,treewidth,edge expansion | Discrete mathematics,Combinatorics,Vertex (geometry),Upper and lower bounds,Cubic graph,Degree (graph theory),Treewidth,Partition (number theory),Cluster analysis,Modularity,Mathematics | Journal |
Volume | Issue | ISSN |
6 | 4 | 2051-1310 |
Citations | PageRank | References |
1 | 0.37 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Colin McDiarmid | 1 | 1071 | 167.05 |
| Fiona Skerman | 2 | 8 | 4.26 |