← Back to Physics and Society
physics.soc-ph

Can we automatically find hidden communities in tangled networks?

Alexandre Benatti, Luciano da F. Costa

June 3, 2026

Researchers combined edge betweenness (a measure of how often connections pass through a node) with dendrogram analysis to automatically identify nested community structures in networks. Unlike supervised methods that need human labels, this approach works blind—building a hierarchy from the network's natural flow patterns. They tested it on fractal networks (which have communities within communities) and partition networks, showing it can both detect clusters and measure how modular they are.
Published as Non-Supervised Community Detection and Hierarchical Modularity Estimation in Complex Networks arXiv:2606.04972
Read the original paper →