For a graph \(G\) admitting a real symmetric realization with exactly two distinct eigenvalues, \(MB(G)\) is the minimum, over all such realizations, of the smaller of the two eigenvalue multiplicities. Adm, Fallat, Meagher, Nasserasr, Plosker, and Yang asked for this parameter for the complement of a path on at least...
It is shown that this condition is not sufficient for the canonical coordinate-wise argmax decoder, and completely classify positively weighted tree metrics whose vertex set is the output space: argmax consistency holds if and only if the tree is a path.
Jin-Tao Fei, Jianglong Luo· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.