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.
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.
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.
Sparse Matrices in Sparse Analysis - Anna Gilbert
Explore sparse matrices in compressive sensing, focusing on expander graphs and their applications. Learn about metric repair scenarios and algorithms for sparse signal recovery.
Grafos Expansores - Introdução e Aplicações
Explore grafos expansores: definição, aplicações, propriedades e resultados. Aprenda sobre sequências, conectividade e o problema principal desses grafos matemáticos.
Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit
Explore derandomization techniques using expander graphs to reduce error in randomized algorithms without significantly increasing random bits used.
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.
Non-virtually Abelian Discontinuous Group Actions vs Proper SL(2,R)-Actions - Aleksy Tralle
Explore non-virtually Abelian discontinuous group actions and proper SL(2,R)-actions in this advanced mathematics lecture, part of a program on Zariski dense subgroups and geometric applications.
Recent Developments in Testing Bounded-Degree Graphs
Explore recent advancements in testing bounded-degree graphs, including locally-characterized expander graphs, graph isomorphism studies, and applications of robustly self-ordered graphs.
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.
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.
List Decoding of Tanner and Expander Amplified Codes
Explore advanced error-correcting code techniques, focusing on list decoding for Tanner and expander amplified codes, with insights from Shashank Srivastava's research.
Sublinear Time Algorithms for Max-Cut Approximation on Expander Graphs
Explore random walks on graphs to achieve better-than-1/2 approximation for max-cut on expanding and clusterable graphs, using sublinear time algorithms.
Expander Graphs - Both Local and Global
Explore expander graphs, their local and global properties, construction methods, and applications in this concise IEEE talk by experts in the field.
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.
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.
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.
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.