Metraipolis › archive › dc_9d2e88346cd8
Dasgupta's Hierarchical Clustering Objective: Geometry and the Price of the Cardinality Constraint — arXiv:2609.07205
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.07205
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T15:31:50.547Z
- SHA-256 of the archived text
c861db7aeffd65c843e741070b770719996ba6f4d5e4272d28f4893832e79ec0- Stable URL of this page
https://metraipolis.com/documento/dc_9d2e88346cd8
How to cite
Dasgupta's Hierarchical Clustering Objective: Geometry and the Price of the Cardinality Constraint — arXiv:2609.07205 — arXiv (en), https://arxiv.org/abs/2609.07205 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9d2e88346cd8 (Metraipolis archive dc_9d2e88346cd8, sha256 c861db7aeffd65c843e741070b770719996ba6f4d5e4272d28f4893832e79ec0)
BibTeX
@misc{dc9d2e88346cd8,
title = {Dasgupta's Hierarchical Clustering Objective: Geometry and the Price of the Cardinality Constraint — arXiv:2609.07205},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.07205},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9d2e88346cd8; sha256 c861db7aeffd65c843e741070b770719996ba6f4d5e4272d28f4893832e79ec0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.07205. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The cost of a hierarchical clustering can be represented by an ultrametric whose lowest-common-ancestor labels are cluster cardinalities. We relate this known representation to the shortest-path geometry of a similarity graph. For a connected support graph $G$, let $d_G$ be its unit-length shortest-path metric and let the edge weights enter only the objective. We prove that the shifted Dasgupta optimum is exactly the minimum edge-weighted cost of a cardinality-realizable ultrametric that dominates $d_G$. Connectedification lemmas put this problem and its freely labeled dominating-ultrametric relaxation on the same class of connected binary hierarchies, labeled respectively by cardinality and graph diameter. As a sharp baseline, we determine the exact worst-case price of cardinality realizability: on every $n$-vertex instance the ratio of the two optima is at most $(2n-1)/3$, with equality on the unweighted complete graph; the sharp factor for the standard unshifted objective is $2(n+1)/3$. Our principal structural result bounds this gap by a hereditary weighted fragmentation profile defined through connected balanced cuts. Uniform local control gives an $O(\log n)$ gap, polynomial decay gives a constant gap, and the logarithmic order is tight even for unweighted trees of maximum degree $3$. On locally regular bounded-degree trees, the hierarchy can be constructed in $O(n\log n)$ time. An energy decomposition and a geometric density bound provide supporting instance-sensitive estimates. Thus the cardinality label has an unavoidable linear worst case but admits substantially smaller bounds on natural sparse graph classes. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in cs.DS). Categorie arXiv: Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2609.07205 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T15:15:08.343Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).