Hierarchical community detection by recursive partitioning

, , , Koen Van Den Berge, , Peter J. Bickel & Elizaveta Levina
The problem of community detection in networks is usually formulated as finding a single partition of the network into some “correct” number of communities. We argue that it is more interpretable and in some regimes more accurate to construct a hierarchical tree of communities instead. This can be done with a simple top-down recursive partitioning algorithm, starting with a single community and separating the nodes into two communities by spectral clustering repeatedly, until a stopping...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.