Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Pseudorandomness: Expander Mixing Lemma
Graph Chatbot
Related lectures (50)
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
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.
Networked Control Systems: Properties and Connectivity
Explores properties of matrices, irreducibility, and graph connectivity in networked control systems.
Matroids: Matroid Intersection
Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.
Graph Algorithms II: Traversal and Paths
Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.
Graph Representation and Traversal
Introduces graph theory basics, graph representation methods, and traversal algorithms like BFS and DFS.
Handling Network Data
Covers handling network data, types of graphs, centrality measures, and properties of real-world networks.
Graph Algorithms: Modeling and Traversal
Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.
Belief Propagation
Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.
Expander Graphs: Properties and Eigenvalues
Log in to Mediaspace to watch this video
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Statistical Analysis of Network Data
Log in to Mediaspace to watch this video
Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.
Interlacing Families and Ramanujan Graphs
Log in to Mediaspace to watch this video
Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.
Szemerédi Regularity Lemma
Log in to Mediaspace to watch this video
Explores the Szemerédi Regularity Lemma, e-regularity in bipartite graphs, supergraph structure, and induction techniques.
Graphical Models: Probability Distributions and Factor Graphs
Log in to Mediaspace to watch this video
Covers graphical models for probability distributions and factor graphs representation.
Sparsest Cut: ARV Theorem
Log in to Mediaspace to watch this video
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.
Isogenic Graphs: Spectral Analysis and Mathematical Applications
Log in to Mediaspace to watch this video
Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.
Graphs: BFS
Log in to Mediaspace to watch this video
Introduces elementary graph algorithms, focusing on Breadth-First Search and Depth-First Search.
Bipartite Graphs: Independent Sets
Log in to Mediaspace to watch this video
Explores bipartite graphs, independent sets, Shearer's Lemma, labeled graphs, and entropy analysis.
Graph Algorithms: Modeling and Representation
Log in to Mediaspace to watch this video
Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.
Previous
Page 1 of 3
Next
