Lecture
Social Network Analysis: Modularity Measure
In course
DEMO: adipisicing aute ullamco amet
Magna non incididunt occaecat laborum est qui duis adipisicing sunt ad ullamco qui ex. Elit aliqua anim est aliquip nostrud nisi pariatur. Elit culpa laboris commodo consequat amet dolor veniam mollit aute tempor.
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
proident eiusmod adipisicing do
Aliqua tempor anim excepteur cupidatat voluptate cupidatat ut occaecat pariatur do do minim ad. Irure tempor laboris anim dolor excepteur esse do reprehenderit officia est aute. Sunt deserunt aute tempor culpa qui ut anim.
Official source
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
Related lectures (34)
Statistical analysis of network data
Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.
Handling Network Data
Explores handling network data, including types of graphs, real-world network properties, and node importance measurement.
Stochastic Block Model: Community Detection
Covers the Stochastic Block Model for community detection.
Epidemic Spreading Models
Covers classical models of epidemic spreading and dynamics on networks with examples.
Handling Network Data
Covers handling network data, types of graphs, centrality measures, and properties of real-world networks.