Adaptive cut reveals multiscale complexity in networks

Clicks: 16
ID: 331411
2026
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #109 of 151 articles by views in PNAS nexus

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 151 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Abstract Hierarchical clustering and community detection are important problems in machine learning and complex network analysis. A common approach to identify clusters is to simply cut dendrograms at some threshold. However, single-level cuts are often suboptimal in terms of capturing underlying structure in the data, especially when the dendrogram is unbalanced. In this paper, we present the adaptive cut, a method that uses the hierarchical structure of dendrograms through multi-level cuts to overcome the limitations of single-level approaches. The adaptive cut optimizes an objective function using a Markov chain Monte Carlo with simulated annealing, resulting in better partitions. We demonstrate the adaptive cut through applications to link clustering and modularity optimization, but note that the method is applicable to any clustering task that relies on a dendrogram and an objective function. Beyond the adaptive cut, we introduce the balancedness score, an information-theoretic metric that quantifies how balanced a dendrogram is. Balancedness predicts the potential benefits of using multi-level cuts. For the community detection examples, we evaluate our method on more than 200 real-world networks and multiple synthetic datasets, demonstrating improvements in partition density and modularity over traditional single-cut approaches. We also show the generality of the adaptive cut by applying it across hierarchical clustering techniques and objective functions. The adaptive cut improves clustering outcomes across a range of hierarchical clustering tasks.
Reference Key
openalex_W7114803196 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Louis Boucherie, Yong-Yeol Ahn, Sune Lehmann
Are you one of these authors? Claim your profile
Journal PNAS nexus
Year 2026
DOI
10.1093/pnasnexus/pgag344
URL
https://doi.org/10.1093/pnasnexus/pgag344
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.