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.
Lecture
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 covers the computation of the modularity measure in a graph, focusing on community detection. It starts with an introduction to the concept of modularity and then explains how to calculate it using networkx in Python. The lecture also delves into the Girvan-Newman algorithm for computing betweenness centrality in a graph, highlighting the importance of edge flow and its impact on community detection.