Class of 1956 Career Development Assistant Professor
Department of Mathematics
Massachusetts Institute of Technology

Email:

Office: 2-271

Mail:
MIT Department of Mathematics
77 Massachusetts Ave, Bldg 2-271
Cambridge, MA 02139, USA

Research areas

Combinatorics, discrete mathematics, graph theory

My research blog

Co-organizer of MIT Combinatorics Seminar

Current PhD students: Benjamin Gunby, Jonathan Tidor

Teaching

Current (Fall 2018):

• 18.211 Combinatorial Analysis
• 18.A34 Mathematical Problem Solving (Putnam Seminar)

Upcoming (Spring 2019):

• 18.218 Probabilistic Method in Combinatorics

Previous

• 18.S997 Graph Theory and Additive Combinatorics (grad), Fall 2017, MIT
• Polynomial Method in Combinatorics (grad), Trinity Term 2016, Oxford

Math Olympiad training handouts

Selected publications

• A relative Szemerédi theorem (with David Conlon and Jacob Fox)
  Geometric and Functional Analysis 25 (2015), 733–762.

• 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.

• Sphere packing bounds via spherical codes (with Henry Cohn)
  Duke Mathematical Journal 163 (2014), 1965–2002.

Videos

• Green-Tao theorem and a relative Szemerédi theorem, Simons Institute, Berkeley, Dec 2013
• Sparse graph regularity tutorial, Simons Institute, Berkeley, Jan 2017
• Large deviations for arithmetic progressions, Simons Institute, Berkeley, Apr 2017

Short CV

• 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