My research interests lie at the interface of combinatorics and probability theory. I combine stochastic process methods with combinatorial constructions to study models of random discrete structures such as graphs, maps, partitions, and permutations.
My focus lies on asymptotic geometric properties such as scaling limits and local weak limits. Motivation for this line of research comes from problems in computer science (average case analysis of algorithms) and physics (two-dimensional quantum gravity).
I enjoy writing open source software (
github project page) that simulates random discrete structures. I have taught courses on interesting topics like Hopf algebras (with
lecture notes).