Related lectures (32)
Stochastic Block Model: Community Detection
Covers the Stochastic Block Model for community detection.
Graph Coloring: Theory and Applications
Explores graph coloring theory, spectral clustering, community detection, and network structures.
Social Network Analysis: Modularity Measure
Explores the computation of the modularity measure and betweenness centrality in graphs for community detection.
Network Formation: Random Connection Models
Explores network formation through random connection models and node degree distribution.
Epidemic Spreading Models
Covers classical models of epidemic spreading and dynamics on networks with examples.
Modularity: Community Detection Algorithms
Explores the Louvain Modularity Algorithm for optimizing community quality through modularity and its applications in social network analysis.
Mining Social Graphs
Explores mining social graphs, regularization, community structures, and community detection algorithms in various applications.
Crystallization and Rubber Elasticity
Explores crystallization kinetics, rubber elasticity, and network formation through crosslinking and entropy-driven processes.
Social and Information Networks: Structure
Explores the structure of social and information networks, focusing on giant components, clustering, tie formation, and network connectivity.
Graph Mining: Modularity and Community Detection
Explores community detection in graphs using modularity and edge betweenness.

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.