This workshop is being live streamed on our website. Full participation (including the capacity to ask questions) will be available via Zoom webinar. 

All talk times are in Pacific Time. 

–
Opening Remarks
–
Tail and Moment Bounds for Gaussian Chaoses in Banach Spaces
Rafal Latala, University of Warsaw
–
Break
–
Aspects of Coulomb Gases
Djalil Chafai, Université Paris-Dauphine - PSL
–
Break
–
Projections of Probability Distributions: A Measure-Theoretic Dvoretzky Theorem
Elizabeth Meckes, Case Western Reserve University
–
Break
–
From Gaussian Measure to Partial Colorings and Linear Size Sparsifiers
Thomas Rothvoss, University of Washington
–
Break
–
A Probabilistic Mechanism for Quark Confinement
Sourav Chatterjee, Stanford University
–
Introductions
–
Sharp Isoperimetric Inequalities for Affine Quermassintegrals
Emanuel Milman, Technion - Israel Institute of Technology
–
Break
–
Poincaré Inequalities and Convergence to Equilibrium with Variable Curvature Bounds
Max Fathi, Institut de Mathematiques de Toulouse
–
Break
–
On Some Brunn-Minkowski Inequalities for Probability Measures Under Symmetry
Galyna Livshyts, Georgia Institute of Technology
–
Break
–
An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices
Shravas Rao, Northwestern University
–
Break
–
Recent Advances in Algorithmic Heavy-Tailed Statistics
Sam Hopkins, UC Berkeley
–
Introductions
–
Random Concave Functions on an Equilateral Lattice with Periodic Hessians
Hari Narayanan; Tata Institute, Mumbai
–
Break
–
Reducing Isotropy to KLS, A Faster Sampling Algorithm
Yin Tat Lee, University of Washington
–
Break
–
Gaussian Regularization of the Pseudospectrum and Numerical Linear Algebra
Nikhil Srivastava, UC Berkeley
–
Break
–
Sharp Thresholds for Random Subspaces, and Applications
Mary Wootters, Stanford University
–
Introductions
–
Moments of the Distance Between Independent Random Vectors
Krzysztof Oleszkiewicz, University of Warsaw
–
Break
–
The Langevin Algorithm in the Non Smooth Log-Concave Case
Joseph Lehec, Université Paris-Dauphine
–
Break
–
Rates of Normal Approximation for Typical Weighted Sums
Sergey Bobkov, University of Minnesota
–
Break
–
Sharp Poincare and log-Sobolev Inequalities for the Switch Chain on Regular Bipartite Graphs
Konstantin Tikhomirov, Georgia Tech
–
Reception via GatherTown
–
Introductions
–
Log Concavity and Concentration of Measure on the Discrete Hypercube
Ronen Eldan, Weizmann Institute of Science
–
Break
–
The (Non-)Concentration of the Chromatic Number
Annika Heckel, Ludwig-Maximilians-Universität München
–
Break
–
Graph Matching in Correlated Random Graphs via Small Subgraph Statistics
Tselil Schramm, Stanford University
–
Break
–
Lower Estimates of Marginal Density
Mark Rudelson, University of Michigan