Suppose I have a square matrix $M$, which you can think of as the weighted adjacency matrix of a graph $G$. I want to order the vertices of $G$ in such a way that the entries of the matrix $M$ are clustered. By this I mean that the weights that are close in value should appear close in $M$.

I know Mathematica has some clustering algorithms implemented. How can I do this with Mathematica?

  • $\begingroup$ See FindClusters and/or ClusteringComponents $\endgroup$ – kglr Oct 13 '14 at 20:05
  • 1
    $\begingroup$ @kguler I have seen those functions, but I don't know how to use them to solve my problem. $\endgroup$ – becko Oct 13 '14 at 20:48
  • 1
    $\begingroup$ Good question.. $\endgroup$ – Daniel Lichtblau Oct 14 '14 at 1:00

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.