Skip to main content
6 votes

When is multidimensional scaling exact for a graph?

If the double centration [1, 2] matrix of your distance (dissimilarity) matrix is gramian (positive semidefinite, that is, all eigenvalues nonnegative) with rank m, then it perfectly spans Euclidean m-...
ttnphns's user avatar
  • 58.1k
5 votes

When is multidimensional scaling exact for a graph?

It can't be always true, because the embedding must satisfy the triangle inequality and your graph might not. Necessary and sufficient conditions are known, but you aren't going to like them>
Thomas Lumley's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible