# CV

# Experience and education

### 2017– Assistant Professor, UT Austin

Since 2017, I have been based at the University of Texas at Austin. (I was actually appointed to this position in 2015, but deferred for two years to go to Bonn (see below). Besides teaching and research (detailed below), I've supervised two senior theses and led curriculum reform for two large courses (M427J and M325K-ECE).

### 2017– Visiting Research Fellow, University of Bonn

When I moved to UT Austin, my position in Bonn got converted to a summer visiting position. Prior to COVID-19, I would visit Bonn every summer for conferences and research collaborations.

### 2015–2017 Bonn Junior Fellow, University of Bonn

I spent two years at the Institute of Applied Mathematics at the University of Bonn, where I taught Masters-level courses, ran research seminars, and supervised Masters and undergraduate theses.

### 2013–2015 Postdoctoral Researcher, UT Austin

My postdoctoral position at UT Austin was jointly funded by the Department of Mathematics, and by Sujay Sanghavi and Constantine Caramanis in the Department of Electrical and Computer Engineering. In addition to my own research, I taught courses in the math department and helped mentor graduate students in the Wireless Networking and Communications Group.

### 2008–2013 Ph.D., UC Berkeley

I got my Ph.D. from the Department of Statistics and the University of California, Berkeley, under the supervision of Elchanan Mossel. My thesis was about isoperimetric properties of the Gaussian measure; for more about that, see my research page.

### 2008 Software Engineering Intern, Google Sydney

Before going to grad school, I spent three months as an intern at Google Sydney, where I helped launch the Google Maps API for Flash. I developed an integration testing framework for Flash and also helped squash various release-blocking bugs. The Flash Maps API lasted for about 3 years.

### 2003–2007 Ph.B., ANU

I got my Bachelor's degree (confusingly called a Ph.B., for "Bachelor of Philosophy") from the Mathematical Sciences Institute at the Australian National University. My Honours thesis, written under the supervision of Shahar Mendelson, was a survey on the math behind machine learning.

# Honors, grants, and awards

I am currently supported by a Fellowship from the Alfred P. Sloan Foundation and an NSF CAREER award. Here is a more comprehensive list of honors, grants, and awards that I have received.

- 2022 NSF CAREER Award: Learning, testing, and hardness via extremal geometric problems
- 2020 Best paper award, IEEE Information Theory for
*Consistency Thresholds for the Planted Bisection Model*with Elchanan Mossel and Allan Sly - 2018 Alfred P. Sloan Research Fellowship
- 2014 Best paper award, Conference on Learning Theory for
*Belief propagation, robust reconstruction, and optimal recovery of block models*with Elchanan Mossel and Allan Sly - 2013 Department of Statistic citation for best thesis in probability, University of California, Berkeley
- 2010–2012 Vertical Integration of Research and Education Graduate Fellowship, University of California, Berkeley
- 2008–2010 Berkeley Fellowship, University of California, Berkeley
- 2007 University Medal (Mathematics), Australian National University
- 2004–2007 Bachelor of Philosophy Scholarship, Australian National University
- 2006 Boyapati Computer Science and Mathematics Award, Australian National University
- 2006 Hannah Neumann Prize for Mathematics, Australian National University

# Selected publications

See Google scholar or the arXiv for a complete list of my publications and preprints. Here is a shorter list of selected publications.

*The Gaussian multi-bubble and double-bubble conjectures*with Emanuel Milman. Annals of Mathematics, 2022*Robust testing of low-dimensional functions*with Anindya De and Elchanan Mossel. ACM Symposium on the Theory of Computing, 2021*A proof of the block model threshold conjecture*with Elchanan Mossel and Allan Sly. Combinatorica, 2018*Consistency thresholds for binary, symmetric block models*with Elchanan Mossel and Allan Sly. ACM Symposium on the Theory of Computing, 2015*Spectral redemption in clustering sparse networks*with Florent Krzakala, Cris Moore, Elchanan Mossel, Allan Sly, Lenka Zdeborova, and Pan Zhang. Proceedings of the National Academy of Sciences, 2013

# Open-source projects

### scribl: simple videos using handwriting and speech

In 2020 I created scribl, a program for efficiently making video lectures. Written in rust with a Druid interface, it includes neural-network-based noise removal and video encoding using gstreamer.

### nnnoiseless: neural-network-based noise removal

An optimized rust port of RNNoise, a fast and power-efficient library
for removing noise from audio. I wrote a blog about the porting process,
and as a result `nnnoiseless`

was featured
as *This Week in Rust*'s crate of the week.

### imbl: immutable collections in rust

Since 2021, I have maintained imbl, a rust crate with fast immutable/persistent collections. I fixed several critical correctness bugs, and improved automatic testing, continuous integration, and fuzzing.

### Druid: data-first UI in rust

I've been a contributor to Druid since 2020 (when I started writing scribl). Among other things, I contributed improved painting performance and implemented cross-platform input APIs.

### GNU LilyPond: beautiful sheet music

From 2016 until around 2012 I was a core developer for GNU LilyPond, a program for typesetting sheet music. Among other things, I implemented new page-breaking and line-breaking algorithms, and improved the algorithms for laying out objects outside the staff.

# Teaching

Here is a list of classes I have taught, some of them multiple times:

- Discrete Mathematics (UT Austin, M325K)
- Probability I (UT Austin, M362K)
- Theory of Probability (UT Austin, M385C)
- Intro to Stochastic Processes (UT Austin, M362M)
- Markov Chains and Mixing Time (UT Austin, M393C)
- Linear Algebra and Matrix Theory (UT Austin, M341)
- Markov Processes (University of Bonn)
- Geometry of Markov Diffusions (University of Bonn)
- Probability in High Dimension (University of Bonn)

# Conference and seminar presentations

*Large deviations in triangle count*, Calculus of Variations in Probability and Geometry, Los Angeles, California, 2022*Large deviations in triangle count*, Probability and Analysis Workshop, online, 2021*Vector-valued noise stability and quantum max-cut*, Online Asymptotic Geometric Analysis Seminar, 2021*The Gaussian isoperimetric inequality and related problems*, Winter School on the interplay between high-dimensional geometry and probability, Bonn, Germany, 2021*Random processes and inference on trees and graphs*, 3rd Warsaw summer school in probability, Warsaw, Poland, 2019*The Gaussian double-bubble conjecture*, Functional inequalities in convexity and probability, Florence, Italy, 2019*The Gaussian double-bubble*, Charles River Lectures, Cambridge, Massachusetts, 2018*Noise stability is computable and approximately low-dimensional*, Conference on Computational Complexity, Riga, Latvia, 2017*rho-concavity*, Convexity, probability, and discrete structures, a geometric viewpoint, Marne-la-Vallee, France, 2015*rho-concavity*, Stochastic processes and applications, Oxford, England, 2015*Gaussian noise stability*, Stochastic processes and high dimensional probability distributions, St. Petersburg, Russia, 2014*Belief propagation, robust reconstruction, and optimal recovery of block models*, Conference on Learning Theory, Barcelona, Spain, 2014*Testing surface area with arbitrary accuracy*, Symposium on the Theory of Computing, New York, New York, 2014*A threshold for stochastic block models*, Workshop on eigenvectors in graph theory and related problems in linear algebra, Providence, Rhode Island, 2014*Robust optimality of Gaussian noise stability*, Workshop on Real Analysis in Testing, Learning, and Inapproximability, Berkeley, California*The "Majority is Stablest" theorem in non-product spaces*, Workshop on Functional Inequalities in Discrete Spaces with Applications, Berkeley, California*Majority is Stablest: discrete and SoS*, Symposium on the Theory of Computing, Palo Alto, California*Sharp upper bounds for clustering in the stochastic block model*, Workshop on Structure, Statistical Inference, and Dynamics in Networks: From Graphs to Rich Data, Santa Fe, New Mexico