Affinity Graph Connectivity in Convex Clustering

ArXi:2605.24673v1 Announce Type: cross We generalize finite-sample bounds for convex clustering to the setting where affinity weights appearing in the objective correspond to a general connected graph. These bounds and their analysis lead to a better understanding of clustering behavior under various implied connectivity structures behind the data and to new rates of convergence for centroid recovery.