Mathematica Stack Exchange is a question and answer site for users of Mathematica. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a fairly large graph (50-60 vertices) with directed, weighted edges, and I am attempting to cluster the vertices. Prior to this, I have only worked with undirected graphs having symmetric adjacency matrices, and I am struggling to figure out an effective means of clustering for the asymmetric case. It seems like the "SingularValueDecomposition" command may be helpful, but I have no experience with this process, and I'm struggling to find an adequate tutorial online. If anyone knows of such a tutorial (or has suggestions for another means of clustering), I would appreciate the help.

share|improve this question

Here's a tutorial on using the SVD to do clustering...

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.