Class of 1956 Career Development Assistant Professor
Department of Mathematics
Massachusetts Institute of Technology
Email:
Office: 2271
Mail:
MIT Department of Mathematics
77 Massachusetts Ave, Bldg 2271
Cambridge, MA 02139, USA
Research areas
Combinatorics, discrete mathematics, graph theory
Coorganizer of MIT Combinatorics Seminar
Current PhD students: Aaron Berger, Benjamin Gunby, Jonathan Tidor
Teaching
Upcoming
 18.A34 Mathematical Problem Solving (Putnam Seminar), Fall 2019
 18.217 Graph Theory and Additive Combinatorics (grad), Fall 2019
 18.212 Algebraic Combinatorics, Spring 2020
Previous
 18.218 Probabilistic Method in Combinatorics (grad), Spring 2019
 18.211 Combinatorial Analysis, Fall 2018
 18.A34 Mathematical Problem Solving (Putnam Seminar), Fall 2018
 18.S997 Graph Theory and Additive Combinatorics (grad), Fall 2017
 Polynomial Method in Combinatorics (grad), Trinity Term 2016, Oxford
Math Olympiad training handouts
Selected publications

Equiangular lines with a fixed angle (with Zilin Jiang, Jonathan Tidor, Yuan Yao, and Shengtong Zhang)

A reverse Sidorenko inequality (with Ashwin Sah, Mehtaab Sawhney, and David Stoner)

Upper tails and independence polynomials in random graphs (with Bhaswar B. Bhattacharya, Shirshendu Ganguly, and Eyal Lubetzky)
Advances in Mathematics 319 (2017), 313–347. 
An $L^p$ theory of sparse graph convergence I: limits, sparse random graph models, and power law distributions (with Christian Borgs, Jennifer T. Chayes, and Henry Cohn)
Transactions of the American Mathematical Society, to appear. 
A relative Szemerédi theorem (with David Conlon and Jacob Fox)
Geometric and Functional Analysis 25 (2015), 733–762. 
Sphere packing bounds via spherical codes (with Henry Cohn)
Duke Mathematical Journal 163 (2014), 1965–2002.
Slides
 Pseudorandom graphs, relative Szemerédi theorem and the GreenTao Theorem
 Large deviations in random graphs
 A reverse Sidorenko inequality: independent sets, colorings, and graph homomorphisms
Videos
 GreenTao theorem and a relative Szemerédi theorem, Simons Institute, Berkeley, December 2013
 Sparse graph regularity tutorial, Simons Institute, Berkeley, January 2017
 Large deviations for arithmetic progressions, Simons Institute, Berkeley, April 2017
 Large Deviations and Exponential Random Graphs, Northeastern University Network Science Institute, May 2018
Short CV
 Sloan Research Fellowship, 2019
 Dénes König Prize, 2018
 Ph.D. Mathematics, MIT, 2015 (Advisor: Jacob Fox)
 M.A.St. Mathematics with Distinction, Cambridge, 2011
 S.B. Mathematics, MIT, 2010
 S.B. Computer Science and Engineering, MIT, 2010
 Previous institutions: Oxford, Berkeley, Microsoft Research