Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Expander Graphs

Showing: 18 courses
Hausdorff Center for Mathematics

Random Graphs and Nonlinear Spectral Gaps

0 rewiews
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.
Add to list
1 Lesons
1 hour 2 minutes
On-Demand
Free-Video
Institute for Advanced Study

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

0 rewiews
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.
Add to list
1 Lesons
1 hour 8 minutes
On-Demand
Free-Video
Institute for Advanced Study

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

0 rewiews
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.
Add to list
1 Lesons
2 hours 6 minutes
On-Demand
Free-Video
Institute for Advanced Study

Sparse Matrices in Sparse Analysis - Anna Gilbert

0 rewiews
Explore sparse matrices in compressive sensing, focusing on expander graphs and their applications. Learn about metric repair scenarios and algorithms for sparse signal recovery.
Add to list
12 Lesons
1 hour 2 minutes
On-Demand
Free-Video
Instituto de Matemática Pura e Aplicada

Grafos Expansores - Introdução e Aplicações

0 rewiews
Explore grafos expansores: definição, aplicações, propriedades e resultados. Aprenda sobre sequências, conectividade e o problema principal desses grafos matemáticos.
Add to list
9 Lesons
33 minutes
On-Demand
Free-Video
Ryan O'Donnell

Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit

0 rewiews
Explore derandomization techniques using expander graphs to reduce error in randomized algorithms without significantly increasing random bits used.
Add to list
17 Lesons
23 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

High Dimensional Expanders

0 rewiews
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.
Add to list
19 Lesons
1 hour 15 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

Non-virtually Abelian Discontinuous Group Actions vs Proper SL(2,R)-Actions - Aleksy Tralle

0 rewiews
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.
Add to list
1 Lesons
47 minutes
On-Demand
Free-Video
Simons Institute

Recent Developments in Testing Bounded-Degree Graphs

0 rewiews
Explore recent advancements in testing bounded-degree graphs, including locally-characterized expander graphs, graph isomorphism studies, and applications of robustly self-ordered graphs.
Add to list
1 Lesons
46 minutes
On-Demand
Free-Video
BIMSA

Hamiltonicity of Expanders: Optimal Bounds and Applications

0 rewiews
Explore optimal bounds and applications of Hamiltonicity in expanders with Nemanja Draganić, delving into extremal and probabilistic combinatorics, Ramsey theory, and theoretical computer science.
Add to list
1 Lesons
1 hour 2 minutes
On-Demand
Free-Video
Ryan O'Donnell

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

0 rewiews
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.
Add to list
6 Lesons
26 minutes
On-Demand
Free-Video
Simons Institute

List Decoding of Tanner and Expander Amplified Codes

0 rewiews
Explore advanced error-correcting code techniques, focusing on list decoding for Tanner and expander amplified codes, with insights from Shashank Srivastava's research.
Add to list
1 Lesons
48 minutes
On-Demand
Free-Video
Simons Institute

Sublinear Time Algorithms for Max-Cut Approximation on Expander Graphs

0 rewiews
Explore random walks on graphs to achieve better-than-1/2 approximation for max-cut on expanding and clusterable graphs, using sublinear time algorithms.
Add to list
1 Lesons
32 minutes
On-Demand
Free-Video
IEEE

Expander Graphs - Both Local and Global

0 rewiews
Explore expander graphs, their local and global properties, construction methods, and applications in this concise IEEE talk by experts in the field.
Add to list
10 Lesons
21 minutes
On-Demand
Free-Video
USENIX

Understanding Lifecycle Management Complexity of Datacenter Topologies

0 rewiews
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.
Add to list
23 Lesons
22 minutes
On-Demand
Free-Video
USENIX

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

0 rewiews
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.
Add to list
19 Lesons
25 minutes
On-Demand
Free-Video
USENIX

Expanding Across Time to Deliver Bandwidth Efficiency and Low Latency

0 rewiews
Innovative network design for datacenters combining low-latency delivery and high-bandwidth efficiency through dynamic reconfiguration, outperforming static topologies for various workloads.
Add to list
10 Lesons
22 minutes
On-Demand
Free-Video
USENIX

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

0 rewiews
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.
Add to list
1 Lesons
17 minutes
On-Demand
Free-Video