My Research

Research Interest

I am interested in probability and combinatorics, including randomized algorithms, random graphs and random tree, in particular:

• Galton-Watson trees

• Binary search trees and split trees

• Random directed graphs

• Peer-to-peer computer networks

• Graph coloring

I also like programming and using computer to experiment, prove, and teach mathematics.

Occasionally I play with special functions.

Publications

You can find all my research papers on Zotero (most up-to-date), Google Scholar (slightly delayed), and arXiv.

Here are some of my open source software projects on GitHub.

My colleagues and friends

• Cecilia Holmgren

• Colin Desmarais

• Debleena Thacker

• Fabian Burghart

• Fiona Skerman

• Gabriel Berzunza Ojeda

• Guillem Perarnau

• Jan Volec

• Johanna Strömberg

• Jonathan Noel

• Jose Luis Lopez Garcia

• Laura Eslava

• Liana Yepremyan

• Lianna Hambardzumyan

• Luc Devroye

• Raazesh Sainudiin

• Stephan Wagner

• Svante Janson

• Yelena Yuditsky

My talks

• Rankings in directed configuration models with heavy tailed in-degrees. Analysis of Algorithms 2021 [slides]

• Cutting resilient networks. [slides]

• Inversions in split trees and conditional Galton–Watson trees. Analysis of Algorithms 2018, STAR Workshop on Random Graphs 2018. [slides]

• A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees. Sweden Probabilistic Midwinter Meeting 2017, Meeting of the Catalan, Spanish, Swedish Math Societies, RS&A 2017. [slides]

• The graph structure of a deterministic automaton chosen at random. RSA 2015. CanaDAM 2015. [slides]

Conferences and workshops

The conferences and workshops which I have attended or plan to attend.

2021

• Analysis of Algorithms 2021

• Entropy Compression and Related Methods