Pseudorandomness: Expander Mixing Lemma

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (29)

Page 1 of 3

Expander Graphs: Properties and Eigenvalues

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Graphical Models: Representing Probabilistic Distributions

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Statistical Analysis of Network Data

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Interlacing Families and Ramanujan Graphs

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Spectral Graph Theory: Introduction

Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.

Graphs: Properties and Representations

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Szemerédi Regularity Lemma

Explores the Szemerédi Regularity Lemma, e-regularity in bipartite graphs, supergraph structure, and induction techniques.

Graphical Models: Probability Distributions and Factor Graphs

Covers graphical models for probability distributions and factor graphs representation.

Interlacing Families and Ramanujan Graphs

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.

Sparsest Cut: ARV Theorem

Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.