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

I am also the author of the software package
`RandomTree.jl`

for simulations of various types of
random trees. It is written in Julia, a Python-like high performance
programming language which is becoming popular in the scientific computing community.

Here are some of my other projects on GitHub.

## My colleagues and friends

We have a big group in probability and combinatorics here in Uppsala:

- Gabriel Berzunza Ojeda
- Fabian Burghart
- Colin Desmarais
- Cecilia Holmgren
- Svante Janson
- Fiona Skerman
- Johanna StrĂ¶mberg
- Stephan Wagner
- Raazesh Sainudiin

Other mathematicians whom I have wrote paper with or did homework together include

- Laura Eslava
- Luc Devroye
- Jose Luis Lopez Garcia
- Tony Johansson
- Guillem Perarnau
- Bruce Reed
- Debleena Thacker
- Yelena Yuditsky

## Talks

Here are the slides for some of my talks:

- 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]