• Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

–
Coffee and Check-In
–
Opening Remarks
–
A Structure Theorem for Boolean Functions with Small Total Influences
Hamed Hatami (McGill University)
–
Break
–
On Mimicking Rademacher Sums
Krzysztof Oleszkiewicz (University of Warsaw)
–
Break
–
Lunch Break
–
Maximal Inequalities on the Hypercube
Alexandra Kolla (University of Colorado Boulder)
–
Break
–
Variants of Parseval's Formula and the Grothendieck Inequality
Ron Blei (University of Connecticut)
–
Break
–
On Correlation Inequalities for Monotone Subsets of the Discrete Cube
Nathan Keller, Bar-Ilan University
–
Coffee and Check-In
–
Concentration Inequalites in Learning with Kernels
Devdatt Dubhashi, Chalmers University of Technology
–
Break
–
Concentration Inequalities for Non-Lipschitz Functions
Paweł Wolff, University of Warsaw
–
Break
–
Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures
Yuval Peres, Microsoft Research Redmond
–
Lunch Break
–
On the Suprema of Bernoulli Processes
Rafał Latała, University of Warsaw
–
Break
–
Spectral Gap of a Kinetically Constrained Spin Model on Trees: Power Law Scaling at Criticality
Cyrille Roberto, Université Paris Ouest
–
Break
–
Open Problem Session
–
Coffee and Check-In
–
Discrete Ricci Curvature via Convexity of the Entropy
Jan Maas, University of Bonn
–
Break
–
Displacement Convexity of Entropy on Graphs
Prasad Tetali (CMU)
–
Break
–
On Graph Spectra and Small Set Expansion
Prasad Raghavendra (UC Berkeley)
–
Lunch Break
–
Two Generalizations of Cheeger's Inequality
Luca Trevisan (Bocconi University)
–
Break
–
On Hyperboundedness and Spectrum of Markov Operators
Laurent Miclo, University of Toulouse
–
Reception
–
Coffee and Check-In
–
A Removal Lemma for Kneser Graphs and Product Graphs
Ehud Friedgut, Weizmann Institute
–
Break
–
Approximations of Submodular, XOS and Self-Bounding Functions by Juntas
Jan Vondrák, IBM Almaden
–
Break
–
Noise Stability and Central Limit Theorem for Random Effective Resistance
Raphaël Rossignol, University of Grenoble
–
Lunch Break
–
Strong Noise Sensitivity and Random Graphs
Jeffrey Steif, Chalmers University of Technology
–
Break
–
Majority is Stablest for Dependent Variables
Joe Neeman (University of Texas, Austin)
–
Coffee and Check-In
–
A Two-Sided Estimate for the Gaussian Noise Stability Deficit
Ronen Eldan, Microsoft Research
–
Break
–
Reversing Hypercontractivity
Elchanan Mossel (Massachusetts Institute of Technology)
–
Break
–
Influences in Gaussian Space
Arnab Sen, University of Minnesota