Lecture

Detecting Communities in Random Graphs

Related lectures (32)

Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.

Statistical Analysis of Network Data: Structures and Models

Explores statistical analysis of network data, covering graph structures, models, statistics, and sampling methods.

Explores advanced graph coloring concepts, including planted coloring, rigidity threshold, and frozen variables in BP fixed points.

Epidemics and Bootstrap Percolation in Square Lattice

Explores epidemics spread models and Bootstrap Percolation in square lattice networks, focusing on the Kolmogorov equation and probability generating functions.

Phase Transitions: Percolation in 2D Networks

Explores phase transitions through percolation in 2D networks.

Stochastic Blockmodel Estimation

Explores Stochastic Blockmodel estimation, spectral clustering, network modularity, Laplacian matrix, and k-means clustering.

Kinetic Theory: Distribution Function Evolution

Explores the evolution of the distribution function describing particles in phase space.

Phase Transitions: Connectivity in Random Graphs

Delves into phase transitions in random graphs, emphasizing the emergence of a giant component with varying connectivity.

Fixed Points in Graph Theory

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Percolation Theory

Covers percolation theory, absorbed polymers, giant molecules, phase transition, scaling assumptions, and universal behavior in percolation models.

Clustering Algorithms: K-Means vs Spectral Clustering

Compares K-Means and Spectral Clustering algorithms, highlighting their differences and practical applications in clustering student behaviors.

Graph Coloring: Random vs Symmetrical

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

Statistical Consequences of Clustering

Covers the statistical consequences of clustering and the complexities of return level estimation in extreme events.

Graph Coloring: Theory and Applications

Covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring.

Supervised Learning Overview

Covers CNNs, RNNs, SVMs, and supervised learning methods, emphasizing the importance of tuning regularization and making informed decisions in machine learning.

Clustering: Unsupervised Learning

Explores clustering in high-dimensional space, covering methods like hierarchical clustering, K-means, and DBSCAN.

Graph Coloring III

Explores properties of clusters and colorability threshold in graph coloring, including average connectivity and rigidity.

Phase Transitions in Energy Systems

Explores phase transitions in energy systems, including non-analytic behavior and the Ising model.

Spin Glasses and Bayesian Estimation

Covers the concepts of spin glasses and Bayesian estimation, focusing on observing and inferring information from a system closely.

Clustering: Unsupervised Learning

Explores dimensionality reduction, clustering algorithms, and the state of machine learning.