I have a fairly sparse adjacency matrix showing connections between approx 5,000 points in my dataset. I'm looking at various ways to analyze the relationships between the data points.
This approach looks interesting: https://www.cs.purdue.edu/homes/dgleich/demos/matlab/spectral/spectral.html
The author sorts the adjacency matrix by the Fiedler vector and obtains what look like interesting results.
I'm looking for reference material about this approach. I've found plenty of references describing using the sign of the Fiedler vector to partition data into two sets (and this can be applied recursively). A direct sort using the Fiedler vector is something I haven't found in the literature. Can anyone tell me whether this is a known technique, and if so, point me towards some reference material about it?