Hierarchical community detection via maximum entropy partitions and the renormalization group
Jorge Martinez Armas

TL;DR
This paper introduces HCE, a novel, model-agnostic framework for detecting meaningful hierarchical community structures in networks by optimizing a trade-off between entropy and the number of communities, applicable across various clustering methods.
Contribution
HCE provides a new, general approach for hierarchical community detection that operates directly on dendrograms without edge-level statistics, improving interpretability and applicability.
Findings
HCE accurately identifies ground-truth hierarchies in synthetic benchmarks.
HCE reveals meaningful modular hierarchies in real-world social and neuroscience networks.
The method is scalable and applicable across diverse network types.
Abstract
Identifying meaningful structure across multiple scales remains a central challenge in network science. We introduce Hierarchical Clustering Entropy (HCE), a general and model-agnostic framework for detecting informative levels in hierarchical community structures. Unlike existing approaches, HCE operates directly on dendrograms without relying on edge-level statistics. It selects resolution levels that maximize a principled trade-off between the entropy of the community size distribution and the number of communities, corresponding to scales of high structural heterogeneity. This criterion applies to dendrograms produced by a wide range of clustering algorithms and distance metrics, including modularity-based and correlation-based methods. We evaluate HCE on synthetic benchmarks with varying degrees of hierarchy, size imbalance, and noise, including LFR and both symmetric and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
