June 24, 2008 
Public lecture: Toys! Toys! Toys! The dynamics of some curious toys G. Bard Ermentrout 


On the Computation of R0 (Including Agestructure Examples) event_1132 


Principles of Immune System Modelling event_1132 


Mathematical Models of the Spread of Influenza A event_1133 

March 24, 2014 
Lecture Michael Szafron (University of Saskatchewan) 


Asymptotically Autonomous and Competitive Systems event_1132 

March 25, 2014 
Lecture Michael Szafron (University of Saskatchewan) 

March 27, 2014 
Lecture Michael Szafron (University of Saskatchewan) 


Optimal Control Applied to CellCycleSpecific Cancer Chemotherapy event_1133 


Modeling of (Infection) Stages with Arbitrary Length Distribution event_1132 

September 08, 2014 
Concentration and AntiConcentration Van Vu (Yale University) 
Probabilistic and Extremal Combinatorics 
September 11, 2014 
Flag Algebras: An Interim Report Alexander Razborov (University of Chicago) 
Probabilistic and Extremal Combinatorics 
September 08, 2014 
Enumeration of Graphs With A HeavyTailed Degree Sequence
Nick Wormald (Monash University) 
Probabilistic and Extremal Combinatorics 
September 11, 2014 
Ramsey Multiplicity David Conlon (University of Oxford) 
Probabilistic and Extremal Combinatorics 
September 10, 2014 
Coloring Graphs with Forbidden Induced Subgraphs Maria Chudnovsky (Columbia University) 
Probabilistic and Extremal Combinatorics 
September 12, 2014 
Phase Transitions in Random Hypergraphs
Mihyun Kang (Technische Universität Graz) 
Probabilistic and Extremal Combinatorics 
September 09, 2014 
Connectivity Thresholds for Bounded Size Rules Angelika Steger (ETH Zürich) 
Probabilistic and Extremal Combinatorics 
September 12, 2014 
The Phase Transition in Site Percolation on PseudoRandom Graphs Michael Krivelevich (Tel Aviv University) 
Probabilistic and Extremal Combinatorics 
September 09, 2014 
List Colourings of Simple Hypergraphs Andrew Thomason (University of Cambridge) 
Probabilistic and Extremal Combinatorics 
September 09, 2014 
Bipartite Decomposition of Graphs Noga Alon (Tel Aviv University) 
Probabilistic and Extremal Combinatorics 
September 09, 2014 
On the Minimum Degree of Minimal RamseyGraphs Tibor Szabó (Freie Universität Berlin) 
Probabilistic and Extremal Combinatorics 
September 10, 2014 
What Does it Mean to Be Free? Tomasz Luczak (Adam Mickiewicz University) 
Probabilistic and Extremal Combinatorics 
September 08, 2014 
On the Applications of Counting Independent Sets in Hypergraphs Jozsef Balogh (University of Illinois at UrbanaChampaign) 
Probabilistic and Extremal Combinatorics 
September 09, 2014 
Turan Numbers of Expanded Forests Zoltan Furedi 
Probabilistic and Extremal Combinatorics 
September 10, 2014 
My Happy Ending Problem János Pach (École Polytechnique Fédérale de Lausanne (EPFL)) 
Probabilistic and Extremal Combinatorics 
September 11, 2014 
Full Subgraphs Jacques Verstraete (University of California, San Diego) 
Probabilistic and Extremal Combinatorics 
September 10, 2014 
On ErdosKoRado for Random Hypergraphs Jeff Kahn (Rutgers, The State University of New Jersey) 
Probabilistic and Extremal Combinatorics 
September 10, 2014 
Cycles in Trianglefree Graphs with Large Chromatic Number Alexandr Kostochka (University of Illinois at UrbanaChampaign) 
Probabilistic and Extremal Combinatorics 
September 11, 2014 
Finding Needles in Exponential Haystacks Joel Spencer (New York University) 
Probabilistic and Extremal Combinatorics 
September 11, 2014 
Extremal Combinatorics, Geometry, and Algebra Jacob Fox (Massachusetts Institute of Technology) 
Probabilistic and Extremal Combinatorics 
September 08, 2014 
The Cost of Knowing Your Roots Bruce Reed (McGill University) 
Probabilistic and Extremal Combinatorics 
September 08, 2014 
Colouring Graphs with No Odd Holes Alexander Scott (University of Oxford) 
Probabilistic and Extremal Combinatorics 
October 01, 2014 
The GreenTao Theorem and a Relative Szemerédi Theorem Yufei Zhao 
Additive and Analytic Combinatorics 
October 01, 2014 
Counting Rational Points via Additive Combinatorics Lilian Matthiesen (Institut de Mathematiques de Jussieu) 
Additive and Analytic Combinatorics 
October 02, 2014 
An Introduction to Inverse LittlewoodOfford Theory Terence Tao (University of California, Los Angeles) 
Additive and Analytic Combinatorics 
October 02, 2014 
Subsequences in Words and Oscillations Boris Bukh (CarnegieMellon University) 
Additive and Analytic Combinatorics 
September 30, 2014 
Seminorms and Inverse Theorems in Additive Combinatorics and Ergodic Theory Tim Austin (New York University) 
Additive and Analytic Combinatorics 
October 02, 2014 
On the SumProduct Problem Jozsef Solymosi (University of British Columbia) 
Additive and Analytic Combinatorics 
September 30, 2014 
An Introduction to Inverse LittlewoodOfford Theory Terence Tao (University of California, Los Angeles) 
Additive and Analytic Combinatorics 
October 02, 2014 
Incomplete Character Sums and Applications MeiChu Chang (University of California) 
Additive and Analytic Combinatorics 
September 29, 2014 
The Distribution of Sandpile Groups of Random Graphs Melanie Wood (University of Wisconsin, Madison) 
Additive and Analytic Combinatorics 
October 03, 2014 
Prime and Almost Prime Points on Homogeneous Varieties Akos Magyar (University of British Columbia) 
Additive and Analytic Combinatorics 
September 30, 2014 
Ramsey Theory at the Junction of Additive and Multiplicative Combinatorics Vitaly Bergelson (The Ohio State University) 
Additive and Analytic Combinatorics 
September 29, 2014 
An Introduction to Inverse LittlewoodOfford Theory Terence Tao (University of California, Los Angeles) 
Additive and Analytic Combinatorics 
September 29, 2014 
Seminorms and Inverse Theorems in Additive Combinatorics and Ergodic Theory Tim Austin (New York University) 
Additive and Analytic Combinatorics 
September 29, 2014 
StanleyWilf Limits are Typically Exponential Jacob Fox (Massachusetts Institute of Technology) 
Additive and Analytic Combinatorics 
September 30, 2014 
An Introduction to Inverse LittlewoodOfford Theory Terence Tao (University of California, Los Angeles) 
Additive and Analytic Combinatorics 
September 29, 2014 
Doubling Less Than 4 and Sets with no Large SumFree Subset Frederick Manners (University of Oxford) 
Additive and Analytic Combinatorics 
October 01, 2014 
Seminorms and Inverse Theorems in Additive Combinatorics and Ergodic Theory Tim Austin (New York University) 
Additive and Analytic Combinatorics 
October 01, 2014 
An Introduction to Inverse LittlewoodOfford Theory Terence Tao (University of California, Los Angeles) 
Additive and Analytic Combinatorics 
October 01, 2014 
Products of Conjugacy Classes Bob Guralnick (University of Southern California) 
Additive and Analytic Combinatorics 
April 15, 2015 
Characterization of cutoff for reversible Markov chains Yuval Peres (Microsoft) 
Information Theory and Concentration Phenomena 
April 15, 2015 
Stability Estimates for the logSobolev Inequality Emanuel Indrei (CarnegieMellon University) 
Information Theory and Concentration Phenomena 
April 16, 2015 
CurvatureDimension Condition for NonConventional Dimensions Emanuel Milman (TechnionIsrael Institute of Technology) 
Information Theory and Concentration Phenomena 
April 16, 2015 
On Talagrand's Convolution Conjecture in Gaussian Space Ronen Eldan (University of Washington) 
Information Theory and Concentration Phenomena 
April 13, 2015 
Information and Statistics Andrew Barron (Yale University) 
Information Theory and Concentration Phenomena 
April 16, 2015 
Random Matrices and Concentration Van Vu (Yale University) 
Information Theory and Concentration Phenomena 
April 13, 2015 
Correlation Distillation Elchanan Mossel (University of California, Berkeley) 
Information Theory and Concentration Phenomena 
April 16, 2015 
Contraction Estimates for Markov Kernels via InformationTransportation Inequalities Maxim Raginsky (University of Illinois at UrbanaChampaign) 
Information Theory and Concentration Phenomena 
April 13, 2015 
Fixed and VariableLength Data Compression at Finite Blocklength Victoria Kostina (California Institute of Technology) 
Information Theory and Concentration Phenomena 
April 17, 2015 
The Lower Tail of Random Quadratic Forms, via the PAC Bayesian Method Roberto Oliveira (Institute of Pure and Applied Mathematics (IMPA)) 
Information Theory and Concentration Phenomena 
April 13, 2015 
The Norm of Some NonStandard Random Matrices Andrea Montanari (Stanford University) 
Information Theory and Concentration Phenomena 
April 17, 2015 
How Large is the Norm of a Random Matrix? Ramon van Handel (Princeton University) 
Information Theory and Concentration Phenomena 
April 13, 2015 
Entropy and Thinning of Discrete Random Variables Oliver Johnson (University of Bristol) 
Information Theory and Concentration Phenomena 
April 14, 2015 
Weak and Strong Moments of l_rnorms of Logconcave Vectors Rafal Latala (University of Warsaw) 
Information Theory and Concentration Phenomena 
April 14, 2015 
Logarithmic Sobolev Inequalities in Discrete Product Spaces: A Proof by a Transportation Cost Distance Katalin Marton (Hungarian Academy of Sciences (MTA)) 
Information Theory and Concentration Phenomena 
April 14, 2015 
The Entropic ErdősKac Limit Theorem Holger Koesters (Universität Bielefeld) 
Information Theory and Concentration Phenomena 
April 14, 2015 
Gaussian Phase Transitions and Conic Intrinsic Volumes: Steining the Steiner formula Larry Goldstein 
Information Theory and Concentration Phenomena 
April 15, 2015 
Eigenvalue Distribution of Optimal Transportation Bo'az Klartag (Tel Aviv University) 
Information Theory and Concentration Phenomena 
April 15, 2015 
Concentration of Spectral Measures of Random Matrices Elizabeth Meckes (Case Western Reserve University) 
Information Theory and Concentration Phenomena 
April 15, 2015 
Bounding Marginal Densities via Affine Isoperimetry Grigorios Paouris (Texas A & M University) 
Information Theory and Concentration Phenomena 
May 19, 2015 
The Exact kSAT Threshold for Large k Nike Sun (Microsoft Research) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 18, 2015 
A Simple Algorithm for Sampling Colourings of G(n, d/n) Up to Gibbs Uniqueness Threshold Charilaos Efthymiou (Georgia Institute of Technology) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 19, 2015 
Spectral Redemption Lenka Zdeborova (Centre National de la Recherche Scientifique (CNRS)) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 21, 2015 
Variations on the alternating direction method of multipliers Jose Bento (Boston College) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 20, 2015 
Approximating a Single Component of the Solution to a Linear System Christina Lee (Massachusetts Institute of Technology) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 20, 2015 
Community Detection in Networks: SDP relaxations and Computational Gaps Yihong Wu (University of Illinois at UrbanaChampaign) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 20, 2015 
Unbalanced Random Matching Markets: The Stark Effect of Competition Yash Kanoria (Columbia University) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 20, 2015 
The Role of Correlation Decay in Filtering Compressed Signal Dynamics Kavita Ramanan (Brown University) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 20, 2015 
Logconcave Sampling with Stochastic Gradient Descent Sébastien Bubeck (Microsoft) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 21, 2015 
Efficiently Learning Ising Models on Arbitrary Graphs Guy Bresler (Massachusetts Institute of Technology) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 18, 2015 
Shotgun Assembly of Graphs Elchanan Mossel (University of California, Berkeley) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 21, 2015 
Personalized Rank Aggregation Sahand Negahban (Yale University) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 18, 2015 
Batched Bandit Problems Philippe Rigollet (Massachusetts Institute of Technology) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 21, 2015 
ReedMuller Codes Achieve Capacity on Erasure Channels Henry Pfister (Duke University) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 18, 2015 
Hiding the Source of a Rumor in Anonymous Messaging Sewoong Oh (University of Illinois at UrbanaChampaign) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 21, 2015 
Sum of Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems Yash Deshpande (Stanford University) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 18, 2015 
Column Subset Selection from Partially Observed Data Aarti Singh (CarnegieMellon University) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 22, 2015 
Global Optima from Local Algorithms Dimitris Achlioptas (University of California) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 18, 2015 
Sparse Sumofsquares Certificates on Finite Abelian Groups Pablo Parrilo (Massachusetts Institute of Technology) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 22, 2015 
Solution Clusters for Locked CSP's: Random XORSAT on a Fixed Degree Sequence Mike Molloy (University of Toronto) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 19, 2015 
Lower Bounds on Thresholds of Graphical Models from Spatial Coupling: Applications to Coding and Constraint Satisfaction Nicolas Macris (École Polytechnique Fédérale de Lausanne (EPFL)) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 20, 2015 
MaxProduct Belief Propagation for Linear Programming in Combinatorial Optimization Jinwoo Shin (Korea Advanced Institute of Science and Technology (KAIST)) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 19, 2015 
L^p Theory of Sparse Graph Limits Jennifer Chayes (Microsoft Research) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
May 19, 2015 
Applications of L^p Theory of Sparse Graph Limits Christian Borgs (Microsoft Research) 
Graphical Models, Statistical Inference, and Algorithms (GRAMSIA) 
November 14, 2014 
DensityType Theorems for SemiAlgebraic Hypergraphs Andrew Suk (University of Illinois, Chicago) 
Geometric and Enumerative Combinatorics 
November 11, 2014 
Many Looks on the Lucas/Fibonacci Sequences and Polynomials Tewodros Amdeberhan (Tulane University) 
Geometric and Enumerative Combinatorics 
November 12, 2014 
Computing Partition Functions in Hard Problems of Combinatorial Enumeration Alexander Barvinok (University of Michigan) 
Geometric and Enumerative Combinatorics 
November 12, 2014 
Hard Tiling Problems with Triangles and Rhombi Jed Yang (University of Minnesota, Twin Cities) 
Geometric and Enumerative Combinatorics 
November 11, 2014 
Combinatorics, Modular Forms, and Discrete Geometry Peter Paule (Johannes Kepler Universität Linz) 
Geometric and Enumerative Combinatorics 