Cluster-Graph Edit Distance: Optimal Explicit Embeddings, Metric Proxies, and Complexity

Abstract

The cluster graphs on $n$ vertices, the disjoint unions of complete graphs, have the integer partitions of $n$ as their isomorphism classes, and the quotient edit distance $q^*(λ,μ)=\min_{σ\in S_n}|E(G_λ)\triangleσE(G_μ)|$ makes that set a metric space. Its geometry and its complexity both issue from one identity: $q^*$ is an affine function of the maximum of $\lVert X\rVert_F^2$ over the contingency tables with margins $λ$ and $μ$. Our main result is an explicit optimal embedding. The weighted dyadic sums of the Ferrers staircase, taken at the critical exponent $\frac14$, give a map $F_n$ into $\ell_2^{\,<4n}$ that acts on a single partition and is computable in $O(n)$ time, and its distortion is $Θ(n^{1/4})$. That order is optimal, since $c_2(\mathcal K_n)=Θ(n^{1/4})$: the lower half follows from a $Θ(\sqrt n)$-dimensional Hamming cube of partitions and Enflo&#39;s theorem, so the determination needs no other external input. The analytic core is a scale-free inverse inequality for every integer sequence with $v(1)=v(N+1)=0$ and $v(s)-v(s+1)\in s\mathbb Z$: its critical dyadic energy is at least $\lVert v\rVert_1^2/(63504\sqrt{\mathrm{TV}(v)})$. Combinatorially the same identity yields two explicit $\ell_1$ models, the vertex-mass metric on sorted degree sequences with $\frac12δ_1\le q^*<\frac32δ_1$ and the block-energy metric with $q^*\le B\le2q^*-1$, both constants optimal; hence $c_1(\mathcal K_n)\le2$, and an $O(n\log n)$-time algorithm returns an alignment of cost below $2q^*$ carrying the certificate $q^*\in[\lceil(B+1)/2\rceil,B]$. Computationally, deciding $q^*(λ,μ)\le Q$ is strongly NP-complete and admits no FPTAS, while the farthest alignment is polynomial-time solvable. The best constant in the inverse inequality remains open; an exactly solvable chirp family caps it at $\frac23$.