Expander Graphs Courses and Certifications

Institute for Advanced Study

Computer Science and Discrete Mathematics

Explore advanced topics in discrete mathematics and theoretical computer science through expert lectures on algorithms, complexity theory, cryptography, and combinatorics.

• YouTube
• 1 month 1 day 20 hours 49 minutes
• On-Demand
• Free Video

Instituto de Matemática Pura e Aplicada

The Extendability Method in Expander Graphs

Explore the extendability method in expander graphs with Matías Pavez-Signé from Universidad de Chile in this lecture from the 2nd Brazilian School of Combinatorics.

• YouTube
• 58 minutes
• On-Demand
• Free Video

USENIX

DistCache - Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching

Innovative distributed caching mechanism providing provable load balancing for large-scale storage systems. Partitions hot objects and adaptively routes queries, enabling linear cache throughput increase with node count.

• YouTube
• 25 minutes
• On-Demand
• Conference Talk

IAS | PCMI Park City Mathematics Institute

Probabilistic and Extremal Combinatorics

Explore advanced discrete mathematics through extremal and probabilistic combinatorics, covering graph theory, Ramsey theory, enumeration methods, and connections to analysis and computer science.

• YouTube
• 1 day 21 hours 57 minutes
• On-Demand
• Free Video

Random Walks on Finite Groups, Part 2 - Lecture 18

Explore Selberg's random walk estimate through the Sarnak-Xue approach in this advanced projection theory lecture covering finite group probability distributions.

• YouTube
• 1 hour 17 minutes
• On-Demand
• Free Video

Random Walks on Finite Groups - Part 3 - Lecture 19

Explore Bourgain-Gamburd results and proof techniques for random walks on finite groups in advanced projection theory.

• YouTube
• 1 hour 23 minutes
• On-Demand
• Free Video

USENIX

Flattened Clos - Designing High-performance Deadlock-free Expander Data Center Networks Using Graph Contraction

Innovative approach to designing high-performance, deadlock-free expander data center networks using graph contraction, offering improved efficiency and throughput compared to traditional Clos networks.

• YouTube
• 17 minutes
• On-Demand
• Conference Talk

Hausdorff Center for Mathematics

High Dimensional Expanders

Explore high-dimensional expanders, their mathematical properties, and applications in theoretical computer science. Learn about coboundary and spectral expansion, and their implications for complex structures.

• YouTube
• 1 hour 15 minutes
• On-Demand
• Free Video

USENIX

Understanding Lifecycle Management Complexity of Datacenter Topologies

Explores lifecycle management complexity of datacenter topologies, comparing Clos and expander graphs. Introduces FatClique, a new topology combining wiring simplicity and expandability, with insights on deployment and expansion costs.

• YouTube
• 22 minutes
• On-Demand
• Conference Talk

USENIX

Expanding Across Time to Deliver Bandwidth Efficiency and Low Latency

Innovative network design for datacenters combining low-latency delivery and high-bandwidth efficiency through dynamic reconfiguration, outperforming static topologies for various workloads.

• YouTube
• 22 minutes
• On-Demand
• Conference Talk

Ryan O'Donnell

Dinur's PCP- Degree-Reduction, Expanderizing, Mini-PCP - Lecture 27c of CS Theory Toolkit

Explore Dinur's PCP Theorem proof, covering degree-reduction, expanderizing, and alphabet-reduction in theoretical computer science. Gain insights into advanced concepts for research in computational complexity.

• YouTube
• 26 minutes
• On-Demand
• Free Video

BIMSA

Hamiltonicity of Expanders: Optimal Bounds and Applications

Explore optimal bounds and applications of Hamiltonicity in expanders with Nemanja Draganić, delving into extremal and probabilistic combinatorics, Ramsey theory, and theoretical computer science.

• YouTube
• 1 hour 2 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Random Graphs and Nonlinear Spectral Gaps

Explore discrete Poincaré inequalities in regular expander graphs, long-range expansion properties, and their implications for Banach space-valued functions, with improved estimates for Poincaré constants.

• YouTube
• 1 hour 2 minutes
• On-Demand
• Free Video

Institute for Advanced Study

Analytic Insights into the Zig-Zag Product and Its Friends - Part I

Explore advanced graph theory with Gil Cohen, delving into the Zig-Zag product and related graph operators using innovative analytic techniques for more precise bounds and insights.

• YouTube
• 1 hour 8 minutes
• On-Demand
• Free Video

Institute for Advanced Study

Analytic Insights into the Zig-Zag Product and Its Friends - Part II

Explore advanced analysis of graph operators using full spectrum and analytic techniques. Gain insights into Zig-Zag product, derandomized squaring, and their optimal bounds through finite free probability and analytic combinatorics.

• YouTube
• 2 hours 6 minutes
• On-Demand
• Free Video