Research interests:
I am an assistant professor of mathematics at the Vienna University of Technology. 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, including various kinds of trees, graphs, maps, partitions, and permutations. Here are some keywords that characterize my activities:
  • Limits of random structures (Gromov-Hausdorff-Prokhorov convergence, local topologies, permuton and graphon convergence, ...)
  • Branching processes and their application to random maps and graphs
  • Enumerative Combinatorics
  • Gibbs partition models
  • Phase transitions and condensation phenomena in weighted random graphs
  • Boltzmann sampling, combinatorial species, random isomorphism classes of structures
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) and Random Trees.

Papers in journals / Preprints:
  1. A branching process approach to level-k phylogenetic networks
    [arXiv]
  2. Cut vertices in random planar maps (joint with M. Drmota and M. Noy)
    Submitted
    [arXiv]
  3. Local convergence of random planar graphs
    Submitted
    [arXiv]
  4. Quenched local convergence of Boltzmann planar maps
    Journal of Theoretical Probability (2021)
    [link] [arXiv]
  5. Rerooting multi-type branching trees: the infinite spine case
    Journal of Theoretical Probability (2021)
    [link] [arXiv]
  6. Graphon convergence of random cographs
    Random Structures & Algorithms (2021)
    [link] [arXiv]
  7. A decorated tree approach to random permutations in substitution-closed classes (joint with J. Borga, M. Bouvel, V. Féray)
    Electronic Journal of Probability (2020), Vol. 25, paper no. 67, 1–52.
    [link] [arXiv]
  8. On the maximal offspring in a subcritical branching process
    Electronic Journal of Probability (2020), Vol. 25, paper no. 104, 1–62.
    [link] [arXiv]
  9. Simply generated unrooted plane trees (joint with L. Ramzews)
    ALEA Latin American Journal of Probability and Mathematical Statistics, Volume XVI (2019), 333–359
    [link] [arXiv]
  10. Graph limits of random unlabelled k-trees (joint with E. Y. Jin)
    Combinatorics, Probability and Computing, Volume 29, Issue 5 (2020), 722–746
    [link] [arXiv]
  11. Pattern occurrences in random planar maps (joint with M. Drmota)
    Statistics and Probability Letters, Volume 158 (2020)
    [link] [arXiv]
  12. Asymptotic properties of random unlabelled block-weighted graphs
    Submitted
    [arXiv]
  13. Geometry of large Boltzmann outerplanar maps (joint with Sigurður Örn Stefánsson)
    Random Structures & Algorithms, Volume 55, Issue 3 (2019), 742–771
    [link] [arXiv]
  14. Limits of random tree-like discrete structures
    Probability Surveys (2020), Vol. 17, No. 0, 318–477
    [link] [hal] [arXiv]
  15. Unlabelled Gibbs partitions
    Combinatorics, Probability and Computing (2020), Volume 29, Issue 2, 293–309
    [link] [hal] [arXiv]
  16. Local limits of large Galton-Watson trees rerooted at a random vertex
    Annales de l'Institut Henri Poincaré - Probabilités et Statistiques (2019), Vol. 55, No. 1, 155–183
    [link] [bibtex] [hal] [arXiv]
  17. Gibbs partitions: the convergent case
    Random Structures & Algorithms, Volume 53, Issue 3 (2018), 537–558
    [link] [bibtex] [hal] [arXiv]
  18. Graph limits of random graphs from a subset of of connected k-trees (joint with M. Drmota, E. Y. Jin)
    Random Structures & Algorithms (2019), Volume 55, 125–152
    [link] [bibtex] [hal] [arXiv]
  19. Random enriched trees with applications to random graphs
    Electronic Journal of Combinatorics, Volume 25, Issue 3 (2018), 81 pp.
    [link] [pdf] [bibtex] [arXiv]
  20. The continuum random tree is the scaling limit of unlabelled unrooted trees
    Random Structures & Algorithms, Volume 55, Issue 2 (2019), 496–528
    [link] [bibtex] [arXiv]
  21. Scaling limits of random Pólya trees (joint with K. Panagiotou)
    Probability Theory and Related Fields, 170 (2018), pp. 801–820
    [link] [bibtex] [arXiv]
  22. Scaling limits of random outerplanar maps with independent link weights
    Annales de l'Institut Henri Poincaré - Probabilités et Statistiques (2017), Vol. 53, No. 2, 900–915
    [link] [pdf] [bibtex] [arXiv]
  23. Scaling limits of random graphs from subcritical classes (joint with K. Panagiotou, K. Weller)
    The Annals of Probability (2016), Vol. 44, No. 5, 3291–3334
    [link] [pdf] [bibtex] [arXiv]

Extended abstracts in conference proceedings:
  1. Cut Vertices in Random Planar Maps (joint with M. Drmota and M. Noy)
    31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020), vol. 159 of Leibniz International Proceedings in Informatics (LIPIcs), p. 10:1–10:18
  2. Local limits of large Galton-Watson trees rerooted at a random vertex
    29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), vol. 110 of Leibniz International Proceedings in Informatics (LIPIcs), p. 34:1–34:11
  3. Scaling limits of random graphs from subcritical classes: Extended abstract (joint with K. Panagiotou, K. Weller)
    27th International Conference on Formal Power Series and Algebraic Combinatorics, DMTCS proc. FPSAC '15, p. 745–756, 2015.

Theses:
  1. Probabilistic analysis of large discrete structures
    Habilitation thesis (submitted)
  2. Scaling limits of random trees and graphs
    PhD thesis, Ludwig Maximilian University of Munich, 2015
    [pdf] [link]
  3. Coxeter groupoids
    Diploma thesis ("Diplomarbeit"), Ludwig Maximilian University of Munich, 2013
    [pdf]

Coauthors: