Detecting or estimating a dense community from a network graph offers a rich set of problems involving the interplay of algorithms, complexity, and information limits. The speaker in his talk will present an overview and recent results on the topic.

Speaker…

Community detection is a key tool in order to understand the structure of the graph. In this talk we will go over 2 popular algorithms (Louvain & BigCLAM), we will learn their theory and also see code examples..

You can find the slides here: https://docs.google.com/presentation/d/1FiIPhd64LzqSeZ1axb7MKBTjkjMsF5bjqljIKrx8k18/edit?usp=sharing

For more information about Stanford’s Artificial Intelligence professional and graduate programs, visit: https://stanford.io/3Eu4Xss

Jure Leskovec
Computer Science, PhD

In this lecture, we first introduce the community structure of graphs and information…