Lecture
Graph Mining: Modularity and Community Detection
Related lectures (37)
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Automorphism Groups: Essential Chief Series
Explores essential chief series in tdlc groups, focusing on closed, normal subgroups and their chief factors.
Social Network Analysis: Modularity Measure
Explores the computation of the modularity measure and betweenness centrality in graphs for community detection.
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.
Max-flow Min-cut Theorem
Explores the equivalence between maximum flow and minimum cut in network theory, demonstrating its applications through examples and edge-disjoint paths.
The Transhipment and Transportation ProblemsMOOC: Optimization: principles and algorithms - Linear optimization
Covers the transhipment and transportation problems in electricity distribution in Switzerland.