I'm currently a PhD candidate at MIT, advised by
Elchanan Mossel. I'm
excited by problems in discrete probability, detection and
inference in random networks, combinatorial and high-dimensional
statistics, and theoretical computer science.
- Some papers include
-
The largest common subtree of two random trees
with Omer Angel, Caelan Atamanchuk, Serte Donderwinkel,
Robin Khanfir.
2026.
-
Asymptotics for the harmonic descent chain and applications
to critical beta-splitting trees
with Byron Chin, Elchanan Mossel.
2025.
-
Detecting Abrupt Changes in Point Processes: Fundamental
Limits and Applications
with Anirudh Sridhar, Elchanan Mossel.
2025.
-
Finding the root in random nearest neighbor trees
with Cassandra Marcussen, Elchanan Mossel, Madhu
Sudan.
Random Structures & Algorithms. 2024.
-
Errors are Robustly Tamed in Cumulative Knowledge
Processes
with Cassandra Marcussen, Elchanan Mossel, Madhu
Sudan.
PNAS. 2023.
-
Universal height and width bounds for random trees
with Louigi Addario-Berry, Jad Hamdan, Céline Kerriou.
Electronic Journal of Probability. 2022.
-
see more
Here are some relevant publications. For a complete list, see
Google Scholar.
detection and inference in random networks
-
Detecting Abrupt Changes in Point Processes: Fundamental
Limits and Applications, with Elchanan Mossel and Anirudh Sridhar. Preprint. 2025.
arXiv. Submitted.
-
Finding the root in random nearest neighbor trees, with Cassandra Marcussen, Elchanan Mossel and Madhu Sudan.
Random Structures & Algorithms, 68 (2): e70057
(2026).
arXiv.
journal.
-
Leaf Stripping on Uniform Attachment Trees, with Louigi Addario-Berry, Simon Briend, Nicolas Broutin and
Gábor Lugosi. Random Structures & Algorithms,
67 (1): e70023 (2025).
arXiv.
journal.
-
Errors are Robustly Tamed in Cumulative Knowledge
Processes, with Cassandra Marcussen, Elchanan Mossel and Madhu Sudan.
Proceedings of the National Academy of Sciences
122 (5) (2025). Conference version in COLT 2024.
arXiv.
journal.
-
Root estimation in Galton-Watson trees, with Luc Devroye and Marcel Goh.
Random Structures & Algorithms 61 (3): 520-542
(2022).
arXiv.
journal.
structure of random trees and graphs
-
The largest common subtree of two random trees, with Omer Angel, Caelan Atamanchuk, Serte Donderwinkel and
Robin Khanfir. Preprint. 2026.
arXiv. Submitted.
-
Asymptotics for the harmonic descent chain and applications
to critical beta-splitting trees, with Byron Chin and Elchanan Mossel. Preprint. 2025.
arXiv. Under review.
-
Does freezing impede the growth of random recursive
trees?
with Simon Briend, Hannah Cairns, Robin Khanfir and Igor
Kortchemski. Preprint. 2025.
arXiv. To be published in Bernoulli.
-
Temporal connectivity of Random Geometric Graphs, with Serte Donderwinkel, Céline Kerriou, Gábor Lugosi and
Rivka Mitchell. Preprint. 2025.
arXiv. Under revision.
-
Universal height and width bounds for random trees, with Louigi Addario-Berry, Jad Hamdan and Céline Kerriou.
Electronic Journal of Probability 27: 1-24 (2022).
arXiv.
journal.
-
The Horton-Strahler number of conditioned Galton-Watson
trees, with Luc Devroye and Tommy Reddad.
Electronic Journal of Probability 26: 1-29 (2021).
journal.
click
here
for a play about a bunch of quantum physicists stuck in an
end-of-the-world grant review committee
click
here
for some introductory math/CS notes
click
here
to spice up your resume with a fresh LaTeX template
click here to generate some random
trees (make sure click on big tree! drag the branches around!)
click here to see pretty animations
of orbits of matrix Lie groups (click on the question mark if
you're confused about what you're seeing!)
click
here
if you've ever wondered what electrodynamics on a flat torus could
be like (click to add charges! watch them spin!)
click
here
if want to hear about the brain-controlled wheelchair we built as
a group of undergrads
technical — html, css,
vanilla js. hosted on github
pages. expanding text uses the
telescoping text
library. icons by
line awesome. © jan
2026.
typography —
neue montreal
by pangram foundry.
friends — some homies with websites (with high probability,
some are missing; if so, with probability one, this is
unintentional).
past academic homes — prior to MIT, i evaded some geese
(did a masters) at the
perimeter institute, working with
aukosh jagannath. before that, i ate some bagels (did my BSc) at
mcgill, doing research with
luc devroye,
louigi addario-berry,
prakash panangaden
and others.
the academic links —
google scholar
. arxiv .
linkedin
the non-academic links —
curius .
github .
letterboxd .
borrow a book