# CS-7863-HW3

Network Clustering using Laplace spectral clustering, Newman modularity, recursive Newman modularity, TOM, dynamic tree cut, and UMAP.


1. Return cluster membership based on the Laplace spectral clustering algorithm for a single split of a network.
2. Implement Newman modularity with a B matrix for a single split of a network.
3. Run the recursive Newman modularity algorithm and discuss the difference between the predicted clusters and the actual Factions.
4. Perform hierachical clustering with Topological Overlap Matrix (TOM) and WGCNA dynamic tree cut.
5. Test UMAP on a network with its distance matrix.
6. Compare the clustering methods.