The NFM strong-node containment conjecture for ℓ₂-norm-diag

Let GG be generated according to the node-feature model (NFM), with simplex distribution given by a Dirichlet distribution with constant parameter. Let V1strong,,VkstrongV_1^{\mathrm{strong}},\dots,V_k^{\mathrm{strong}} denote the strong-node sets, and let 2\ell_2-norm-diag be the stated recovery procedure.

NFM strong-node containment conjecture. With probability not converging to 00 as nn\to\infty, 2\ell_2-norm-diag returns exactly kk disjoint clusters V1,,VkV_1',\dots,V_k' such that, for every j[k]j\in[k],

VjstrongVj.V_j^{\mathrm{strong}}\subseteq V_j'.

The conjecture is motivated by theoretical robustness bounds and experiments showing that the method can recover disjoint clusters containing all strong nodes, possibly together with fringe nodes. It remains open whether this behavior persists with nonvanishing probability asymptotically.

Sources & referencesView supporting material

Primary source

Jimit Majmudar and Stephen Vavasis, “Robust Correlation Clustering with Asymmetric Noise”, arXiv:2110.08385 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.