Organizing Committee
 Shiri ArtsteinAvidan
Tel Aviv University  Ronen Eldan
Weizmann Institute of Science  Bo'az Klartag
The Weizmann Institute of Science  Mark Rudelson
University of Michigan  Ramon van Handel
Princeton University
Abstract
Probabilistic methods have long played an important role in various areas of geometry and analysis. Notable applications of probabilistic methods appear, for example, in geometric functional analysis, in harmonic analysis, and in discrete mathematics. Conversely, mathematical phenomena of fundamentally geometric and analytic origin, such as the concentration of measure phenomenon, play a central role in modern probability theory. Novel interactions between probability, geometry and analysis continue to drive important innovations in these fields.
The aim of this workshop is to bring together a diverse range of experts from probability, geometry, and analysis, in order to promote further dialogue between these fields and to catalyze the creation of new interactions.
Confirmed Speakers & Participants
Talks will be presented virtually or inperson as indicated in the schedule below.
 Speaker
 Poster Presenter
 Attendee
 Virtual Attendee

Soheil Anbouhi
Haverford College

Shiri ArtsteinAvidan
Tel Aviv University

Rotem Assouline
Weizmann Institute of Science

Aidan Backus
Brown University

Alexander Barvinok
University of Michigan

Sergey Bobkov
University of Minnesota

Alan Chang
Princeton University

Effrosyni Chasioti
Kent State University

Krzysztof Ciosmak
Fields Institute/University of Toronto

José Manuel Conde Alonso
Universidad Autónoma de Madrid

Dario CorderoErausquin
Sorbonne University

Amalia Culiuc
Amherst College

Susanna Dann
Universidad de los Andes

Xiaoyu Dong
University of Michigan

Hongjie Dong
Brown University

Keiko Dow
D'Youville College

Devraj Duggal
University of MinnesotaTwin Cities

Polona Durcik
Chapman University

Alexandros Eskenazis
University of Cambridge

Manuel Fernandez
Georgia Institute of Technology

Leonardo Ferrari
Université de Neuchâtel

Eduardo GarciaJuarez
Universitat de Barcelona

Ryan Gibara
University of Cincinnati

Tainara Gobetti Borges
Brown University

Javier Gomez Serrano
Brown University

Maria (Masha) Gordina
University of Connecticut

Rachel Greenfeld
Institute for Advanced Study

Wyatt Gregory
University of Missouri  Columbia

Orli Herscovici
Georgia Institute of Technology

Irina Holmes Fay
Texas A&M University

Xuehan Hu
Texas A&M University

Han Huang
Georgia Institute of Technology

Weiyan Huang
Washington University in St. Louis

Brice Huang
Massachusetts Institute of Technology

Paata Ivanishvili
University of California, Irvine

Ben Jaye
Georgia Tech

David Jerison
MIT

Fushuai Jiang
University of Maryland

Bo'az Klartag
The Weizmann Institute of Science

Alexander Koldobskiy
University of MissouriColumbia

Gil Kur
Massachusetts Institute of Technology (MIT)

Sefika Kuzgun
University of Rochester

Dylan Langharst
Kent State University

Rafał Latała
University of Warsaw

James Lee
University of Washington

Joseph Lehec
Université ParisDauphine

Brett Leroux
University of California, Davis

Zane Li
University of WisconsinMadison

Alexander Litvak
University of Alberta

Galyna Livshyts
Georgia Tech

Jose Ramon Madrid Padilla
UCLA  University of California Los Angeles

Alex McDonald
The Ohio State University

Dan Mikulincer
MIT

Joseph Miller
University of Texas at Austin

Jelani Nelson
UC Berkeley

Oanh Nguyen
Brown University

Keith Promislow
Michigan State University

Eli Putterman
Tel Aviv University

Luis Rademacher
University of California, Davis

Abba Ramadan
The university of Alabama

Kavita Ramanan
Brown University

Chase Reuter
North Dakota State University

Liran Rotem
Technion  Israel Institute of Technology

Michael Roysdon
Tel Aviv University

Mark Rudelson
University of Michigan

Dmitry Ryabogin
Kent State University

Carsten Schuett
CAU Kiel

Vadim Semenov
NYU

Yair Shenfeld
MIT

Nimita Shinde
IITBMonash Research Academy

Paul Simanjuntak
University of Missouri  Columbia

Stanislaw Szarek
Case Western Reserve U.

Maud Szusterman
Université de Paris

Kateryna Tatarko
University of Waterloo

Konstantin Tikhomirov
Carnegie Mellon University

Tomasz Tkocz
Carnegie Mellon University

Sergei Treil
Brown University

Jacopo Ulivelli
La Sapienza, University of Rome

Ramon van Handel
Princeton University

Dimitrios Vardakis
Michigan State University

Santosh Vempala
Georgia Tech

Naga Manasa Vempati
Georgia Institute of Technology

Praneeth Vepakomma
MIT

Rick Vitale
University of Connecticut

Alexander Volberg
Michigan State University

Nathan Wagner
Brown University

Ke Wang
Hong Kong University of Science and Technology

Elisabeth Werner
Case Western Reserve University

Qiang Wu
University of Illinois

Kasia Wyczesany
Tel Aviv University

Sudan Xing
University of Alberta

Andrew Yarmola
Princeton University

Vladyslav Yaskin
University of Alberta

Pierre Youssef
New York University Abu Dhabi

Shuya Yu
University of Delaware

Bartłomiej Zawalski
Polish Academy of Sciences

Haonan Zhang
IST Austria

Shixuan Zhang
Georgia Institute of Technology

Tianyi Zheng
UCSD

Artem Zvavitch
Kent State University
Workshop Schedule
Monday, October 17, 2022

8:50  9:00 am EDTWelcome11th Floor Lecture Hall
 Session Chair
 Brendan Hassett, ICERM/Brown University

9:00  9:45 am EDTUpper bounds for the Fisher information11th Floor Lecture Hall
 Speaker
 Sergey Bobkov, University of Minnesota
 Session Chair
 Ramon van Handel, Princeton University
Abstract
We discuss upper bounds for the Fisher information in high dimensions in terms of the total variation and norms in Sobolev spaces.

10:00  10:30 am EDTCoffee Break11th Floor Collaborative Space

10:30  11:15 am EDTThe convex hull of space curves with totally positive torsion11th Floor Lecture Hall
 Virtual Speaker
 Paata Ivanishvili, University of California, Irvine
 Session Chair
 Ramon van Handel, Princeton University
Abstract
Finding a simple description of a convex hull of a set K in ndimensional Euclidean space is a basic problem in mathematics. When K has some additional geometric structures one may hope to give an explicit construction of its convex hull. A good starting point is when K is a space curve. In this talk I will describe convex hulls of space curves which have a "very" positive torsion. In particular, we obtain a parametric representation of the boundary of the convex hull, different formulas for their Euclidean volumes and the surface areas, and the solution to a general moment problem corresponding to such curves. This is joint work with Jaume de Dios Pont and Jose Ramon Madrid Padilla.

11:30 am  12:15 pm EDTHow curved are level surfaces of eigenfunctions?11th Floor Lecture Hall
 Virtual Speaker
 David Jerison, MIT
 Session Chair
 Ramon van Handel, Princeton University
Abstract
I will discuss several conjectures about level sets of eigenfunctions in convex domains.

12:30  2:30 pm EDTLunch/Free Time

2:30  3:15 pm EDTApproximation of convex bodies in Hausdorff distance by random polytopes11th Floor Lecture Hall
 Speaker
 Elisabeth Werner, Case Western Reserve University
 Session Chair
 Mark Rudelson, University of Michigan
Abstract
While there is extensive literature on approximation, deterministic as well as random, of general convex bodies in the symmetric difference metric, or other metrics coming from intrinsic volumes, very little is known for corresponding random results in the Hausdorff distance. For a polygon Q in the plane, the convex hull of n points chosen at random on the boundary of Q gives a random polygon Q_n. We determine the exact limiting behavior of the expected Hausdorff distance between Q and a random polygon Q_n as the number n of points chosen on the boundary of Q goes to infinity. Based on joint work with J. Prochno, C. Schuett and M. Sonnleitner.

3:30  4:00 pm EDTCoffee Break11th Floor Collaborative Space

4:00  4:45 pm EDTGeneral Probabilistic Theories, tensor products, and projective transformations11th Floor Lecture Hall
 Speaker
 Stanislaw Szarek, Case Western Reserve U.
 Session Chair
 Mark Rudelson, University of Michigan
Abstract
Generalized Probabilistic Theories (GPTs) are theories of nature that have random features. A GPT must specify the set of states purporting to represent the physical reality, the allowable measurements, the rules for outcome statistics of the latter, and the composition rules describing what happens when we merge subsystems and create a larger system. Examples include classical probability and quantum theory. The composition rules alluded to above usually involve tensor products, including tensor products of normed spaces, convex sets and of cones. Among tensor products that have operational meaning in the GPT context, the projective and the injective product are the extreme ones, which leads to the natural question "How much do they differ?" considered already by Grothendieck and Pisier (in the 1950s and 1980s). We report on quantitative results concerning projective/injective discrepancy for finitedimensional normed spaces. Some of the results are essentially optimal, but others can be likely improved. The methods involve a wide range of techniques from geometry of Banach spaces and random matrices. We also report on parallel results in the context of cones. Finally, we will encourage a more systematic study of convex bodies with the allowed morphisms being projective transformations. Joint work with G. Aubrun, L. Lami, C. Palazuelos, A. Winter (and a parallel work by a subset of coauthors and M. Plavala).

5:00  6:30 pm EDTReception11th Floor Collaborative Space
Tuesday, October 18, 2022

9:00  9:45 am EDTLarge Deviations of Random Projections of Convex Bodies11th Floor Lecture Hall
 Speaker
 Kavita Ramanan, Brown University
 Session Chair
 Vladyslav Yaskin, University of Alberta
Abstract
I will provide a survey of large deviation principles for projections of highdimensional convex bodies. This is based on various joint works with N. Gantert, S.S. Kim, Y.T. Liao, P. Lopatto and D. Xie.

10:00  10:30 am EDTCoffee Break11th Floor Collaborative Space

10:30  11:15 am EDTPrivate frequency estimation via projective geometry11th Floor Lecture Hall
 Speaker
 Jelani Nelson, UC Berkeley
 Session Chair
 Vladyslav Yaskin, University of Alberta
Abstract
Many of us use smartphones and rely on tools like autocomplete and spelling autocorrect to make using these devices more pleasant, but building these tools presents a challenge. On the one hand, the machinelearning algorithms used to provide these features require data to learn from, but on the other hand, who among us is willing to send a carbon copy of all our text messages to device manufacturers to provide that data? "Local differential privacy" (LDP) and related models have become the gold standard for understanding the tradeoffs possible between utility and privacy loss. In this talk we present a new LDP mechanism for estimating data histograms over large numbers of users, making use of projective geometry together with a dynamic programming based reconstruction algorithm. I will also mention the opportunity for tools from this community to have impact in mobile devices, e.g. the SQKR mechanism of [Chen, Kairouz, Ozgur'20] on private mean estimation using work on Kashin representations by Lyubarskii and Vershynin. This talk is based on joint work with Vitaly Feldman (Apple), Huy Le Nguyen (Northeastern), and Kunal Talwar (Apple).

11:30 am  12:15 pm EDTSpectral hypergraph sparsification via chaining11th Floor Lecture Hall
 Speaker
 James Lee, University of Washington
 Session Chair
 Vladyslav Yaskin, University of Alberta
Abstract
Using aspects of Talagrand's generic chaining theory, we show how to construct spectral hypergraph epssparsifiers with only O(eps^{2} log(r) n log n) hyperedges, where n is the number of vertices and r is the rank of the hypergraph.

12:30  2:30 pm EDTLunch/Free Time

2:30  3:15 pm EDTEmbedding the hypercube into dense bipartite graphs11th Floor Lecture Hall
 Speaker
 Konstantin Tikhomirov, Carnegie Mellon University
 Session Chair
 Rick Vitale, University of Connecticut
Abstract
A well known conjecture of Burr and Erdos asserts that the Ramsey number of the hypercube on 2^n vertices is of the order O(2^n). Motivated by this problem, we construct randomized embeddings of the hypercube into dense bipartite graphs and, as a corollary, show that the Ramsey number of the hypercube is of order O(2^{2n−cn}) for a universal constant c>0. This improves upon the previous best known bound O(2^{2n}), due to Conlon, Fox and Sudakov.

3:30  4:00 pm EDTCoffee Break11th Floor Collaborative Space

4:00  4:45 pm EDTVolume growth of groups and random walks11th Floor Lecture Hall
 Speaker
 Tianyi Zheng, UCSD
 Session Chair
 Rick Vitale, University of Connecticut
Wednesday, October 19, 2022

9:00  9:45 am EDTRegularity for weighted convex isoperimetric problems11th Floor Lecture Hall
 Speaker
 Alexandros Eskenazis, University of Cambridge
 Session Chair
 Bo'az Klartag, The Weizmann Institute of Science
Abstract
We shall discuss results and open questions pertaining to the regularity (and irregularity) of solutions of weighted isoperimetrictype problems over the class of symmetric convex sets. Based on joint work with G. Moschidis (EPFL)

10:00  10:30 am EDTCoffee Break11th Floor Collaborative Space

10:30  11:15 am EDTAverage Case Analysis of Gaussian Elimination with Partial Pivoting11th Floor Lecture Hall
 Speaker
 Han Huang, Georgia Institute of Technology
 Session Chair
 Bo'az Klartag, The Weizmann Institute of Science
Abstract
The Gaussian Elimination with Partial Pivoting (GEPP) is a classical algorithm for solving systems of linear equations. Although in specific cases the loss of precision in GEPP due to roundoff errors can be very significant, empirical evidence strongly suggests that for a typical square coefficient matrix, GEPP is numerically stable. We obtain a (partial) theoretical justification of this phenomenon by showing that, given the random n x n standard Gaussian coefficient matrix A, the growth factor of the Gaussian Elimination with Partial Pivoting is at most polynomially large in n with probability close to one. This implies that with high probability the number of bits of precision sufficient to solve Ax=b to m bits of accuracy using GEPP is m + O(log(n)), which improves an earlier estimate m + O( log^2 n) of Sankar, and which we conjecture to be optimal by the order of magnitude. We further provide tail estimates of the growth factor which can be used to support the empirical observation that GEPP is more stable than the Gaussian Elimination with no pivoting. This talk is based on a joint work with Konstantin Tikhomirov.

11:30 am  12:15 pm EDTOn the minimum of Gaussian variables.11th Floor Lecture Hall
 Speaker
 Alexander Litvak, University of Alberta
 Session Chair
 Bo'az Klartag, The Weizmann Institute of Science
Abstract
Let $X=(\xi_1, ..., \xi_m)$ be a centered Gaussian random vector, such that the variances of each $\xi_i$ equals to 1. Under what assumptions on the covariance matrix is the expectation of $\min_i \xi_i$ minimized? We discuss known results and conjectures related to this question.

12:25  12:30 pm EDTGroup Photo (Immediately After Talk)11th Floor Lecture Hall

12:30  2:30 pm EDTLunch/Free Time

2:30  3:15 pm EDTLimit laws and hypoellipticity11th Floor Lecture Hall
 Speaker
 Maria (Masha) Gordina, University of Connecticut
 Session Chair
 Pierre Youssef, New York University Abu Dhabi
Abstract
We will consider several classical problems for hypoelliptic diffusions and random walks: the large deviations principle (LDP), the small ball problem (SBP), Chung’s law of iterated logarithm (LIL), and finding the OnsagerMachlup functional. As two very different examples we will look at hypoelliptic Brownian motion and the corresponding random walk on the Heisenberg group, and the Kolmogorov diffusion. We will explore the role of spacetime scaling property, Gaussianity, and spectral properties via Dirichlet forms in these settings. The OnsagerMachlup functional is used to describe the dynamics of a continuous stochastic process, and it is closely related to the SBP and LIL, as well as the rate functional in the LDP. Unlike in the elliptic (Riemannian) case we do not rely on the tools from differential geometry such as comparison theorems or curvature bounds as these are not always available in the hypoelliptic (subRiemannian) setting. The talk is based on the joint work with Marco Carfagnini, Tai Melcher and Jing Wang.

3:30  4:00 pm EDTCoffee Break11th Floor Collaborative Space

4:00  4:45 pm EDTUniversality for random polynomials: framework and applications11th Floor Lecture Hall
 Speaker
 Oanh Nguyen, Brown University
 Session Chair
 Pierre Youssef, New York University Abu Dhabi
Abstract
Random polynomials have been studied since the early 1900s with notable publications by Erdos, Kac, Littlewood, Offord, and others. In recent years, universality has emerged as a powerful method that systematically tackles longstanding problems on the distribution of roots. In this talk, I will discuss a general framework to establish universality properties. I shall go over the application of this framework to different families of polynomials and how to use these properties to answer classical questions in the field. This is based on joint work with Yen Do, Doron Lubinsky, Hoi Nguyen, Igor Pritsker, and Van Vu.
Thursday, October 20, 2022

9:00  9:45 am EDTTransportation of measures via Langevin flows11th Floor Lecture Hall
 Speaker
 Yair Shenfeld, MIT
 Session Chair
 Alexander Volberg, Michigan State University
Abstract
A basic problem in probability theory and engineering is finding a way of representing a complicated probability measure as a simpler probability measure under some transformation. A desirable property of such transformations is that it is Lipschitz, since it allows for information from the simpler probability measure to be transferred to the complicated measure. While various transformations (optimal transport, KnotheRosenblatt rearrangement) exist, establishing their regularity is a difficult problem. In this talk, I will discuss the Lipschitz properties of the Langevin transport map which is constructed infinitesimally along the Langevin dynamics. I will show that this map is Lipschitz in many settings where no other Lipschitz transport maps are known to exist. I will conclude the talk by introducing a new connection between the Langevin transport map and renormalization groups methods from quantum and statistical field theories.

10:00  10:30 am EDTCoffee Break11th Floor Collaborative Space

10:30  11:15 am EDTHorocyclic BrunnMinkowksi inequality11th Floor Lecture Hall
 Speaker
 Rotem Assouline, Weizmann Institute of Science
 Session Chair
 Alexander Volberg, Michigan State University
Abstract
The BrunnMinkowski inequality fails dramatically on the hyperbolic plane. We show that this can be remedied by defining Minkowski summation with horocycles instead of geodesics. Joint with Bo'az Klartag.

11:30 am  12:15 pm EDTThe estimate for the Dimensional BrunnMinkowski conjecture for all logconcave measures11th Floor Lecture Hall
 Speaker
 Galyna Livshyts, Georgia Tech
 Session Chair
 Alexander Volberg, Michigan State University
Abstract
We will show that for any even logconcave measure \mu and any pair of symmetric convex sets K and L, and any t between 0 and 1, one has the inequality: \mu(tK+(1t)L)^{c(n)}\geq t\mu(K)^{c(n)}+(1t)\mu(L)^{c(n)}, Where c(n)=n^{4o(1)}. This constitutes progress towards the Dimensional BrunnMinkowski conjecture.

12:25  12:30 pm EDTSemester Program Organizer PhotoGroup Photo (Immediately After Talk)  11th Floor Lecture Hall

12:30  2:30 pm EDTLunch/Free Time

2:30  3:15 pm EDTBounding suprema of canonical processes via convex hull11th Floor Lecture Hall
 Speaker
 Rafał Latała, University of Warsaw
 Session Chair
 Artem Zvavitch, Kent State University
Abstract
We discuss the method of bounding suprema of canonical processes based on the inclusion of their index set into a convex hull of a wellcontrolled set of points. While the upper bound is immediate, the reverse estimate was established to date only for a narrow class of regular stochastic processes (for which the chaining method works). We show that for specific index sets, including arbitrary ellipsoids, regularity assumptions may be substantially weakened.

3:30  4:00 pm EDTCoffee Break11th Floor Collaborative Space

4:00  4:45 pm EDTA Gaussian correlation inequality for p.s.h. functions11th Floor Lecture Hall
 Speaker
 Dario CorderoErausquin, Sorbonne University
 Session Chair
 Artem Zvavitch, Kent State University
Abstract
A positive correlation inequality is established for circularinvariant plurisubharmonic functions, with respect to complex Gaussian measures. The main ingredients of the proofs are the OrnsteinUhlenbeck semigroup, and another natural semigroup associated to the Gaussian dbarLaplacian. Joint work with Franck Barthe.
Friday, October 21, 2022

9:00  9:45 am EDTA quick estimate for the volume of a polyhedron11th Floor Lecture Hall
 Virtual Speaker
 Alexander Barvinok, University of Michigan
 Session Chair
 Carsten Schuett, CAU Kiel
Abstract
Let P be a bounded polyhedron, defined as the intersection of the nonnegative orthant in R^n and an affine subspace of codimension m. I present a simple and computationally efficient formula that approximates the volume of P within a factor c^m, where c > 0 is an absolute constant. This is joint work with Mark Rudelson.

10:00  10:30 am EDTCoffee Break11th Floor Collaborative Space

10:30  11:15 am EDTBourgain’s slicing problem and KLS isoperimetry up to polylog11th Floor Lecture Hall
 Speaker
 Joseph Lehec, Université ParisDauphine
 Session Chair
 Carsten Schuett, CAU Kiel
Abstract
We prove that Bourgain’s hyperplane conjecture and the KannanLovaszSimonovits isoperimetric conjecture hold true up to a factor that is polylogarithmic in the dimension.

11:30 am  12:15 pm EDTA *Slightly* Improved Bound for the KLS Constant (or The Fashion Wars: LV vs Ldan)11th Floor Lecture Hall
 Speaker
 Santosh Vempala, Georgia Tech
 Session Chair
 Carsten Schuett, CAU Kiel
Abstract
We refine the recent breakthrough technique of Klartag and Lehec to obtain an improved polylogarithmic bound for the KLS constant.

12:30  2:30 pm EDTLunch/Free Time

2:30  3:15 pm EDTA stochastic approach for noise stability on the hypercube11th Floor Lecture Hall
 Speaker
 Dan Mikulincer, MIT
 Session Chair
 Luis Rademacher, University of California, Davis
Abstract
We revisit the notion of noise stability in the hypercube and show how one can replace the usual heat semigroup with more general stochastic processes. We will then introduce a renormalized Brownian motion, embedding the discrete hypercube into the Wiener space, and analyze the noise stability along its paths. Our approach leads to a new quantitative form of the 'Majority is Stablest' theorem from Boolean analysis and to progress on the 'most informative bit' conjecture of Courtade and Kumar.

3:30  4:00 pm EDTCoffee Break11th Floor Collaborative Space
All event times are listed in ICERM local time in Providence, RI (Eastern Standard Time / UTC5).
All event times are listed in .
ICERM local time in Providence, RI is Eastern Standard Time (UTC5). Would you like to switch back to ICERM time or choose a different custom timezone?