Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture by the instructor covers nonparametric network summaries, including definitions of centrality measures like closeness and harmonic centrality, network modularity, and clustering coefficients. The lecture also discusses spectral clustering and Laplacian matrices for graph clustering.