Lecture

Social Network Analysis: Modularity Measure

In course

Esse anim laboris ea veniam ut consequat. Elit in occaecat aute sint. Do do dolore consequat deserunt in voluptate et id sint laborum. Duis pariatur anim pariatur reprehenderit.

Description

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.

Instructor

magna in Lorem incididunt

Id ex nostrud et dolore dolor nulla. Exercitation qui minim laboris adipisicing in. Officia anim do ad aliquip ut irure consequat non.

Official source

https://mediaspace.epfl.ch/media/0_e8q66fof

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (34)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.