| Publication | Date of Publication | Type |
|---|
Minimum stationary values of sparse random directed graphs
The Annals of Applied Probability | 2026-03-10 | Paper |
Rankings in directed configuration models with heavy tailed in-degrees
The Annals of Applied Probability | 2024-01-19 | Paper |
The diameter of the directed configuration model
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2023-02-28 | Paper |
| scientific article; zbMATH DE number 7651044 (Why is no real title available?) | 2023-02-07 | Paper |
The fluctuations of the giant cluster for percolation on random split trees
(available as arXiv preprint) | 2022-08-02 | Paper |
| The fluctuations of the giant cluster for percolation on random split trees | 2022-08-02 | Paper |
The giant component of the directed configuration model revisited
(available as arXiv preprint) | 2021-08-06 | Paper |
| The giant component of the directed configuration model revisited | 2021-08-06 | Paper |
Inversions in split trees and conditional Galton-Watson trees
(available as arXiv preprint) | 2021-06-15 | Paper |
The analysis of Kademlia for random IDs
Internet Mathematics | 2021-04-26 | Paper |
The \(k\)-cut model in deterministic and random trees
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
| Minimum stationary values of sparse random directed graphs | 2020-10-14 | Paper |
Inversions in split trees and conditional Galton-Watson trees
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
The diameter of the directed configuration model
(available as arXiv preprint) | 2020-03-10 | Paper |
| k-cuts on a path | 2020-02-06 | Paper |
Cutting resilient networks -- complete binary trees
The Electronic Journal of Combinatorics | 2019-12-09 | Paper |
Cutting resilient networks -- complete binary trees
The Electronic Journal of Combinatorics | 2019-12-09 | Paper |
A note on the asymptotic expansion of the Lerch's transcendent
Integral Transforms and Special Functions | 2019-08-26 | Paper |
\(k\)-cut on paths and some trees
Electronic Journal of Probability | 2019-06-20 | Paper |
\(k\)-cut on paths and some trees
Electronic Journal of Probability | 2019-06-20 | Paper |
Non-fringe subtrees in conditioned Galton-Watson trees
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
Non-fringe subtrees in conditioned Galton-Watson trees
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
The graph structure of a deterministic automaton chosen at random
Random Structures & Algorithms | 2017-10-24 | Paper |
Acyclic edge colourings of graphs with large girth
Random Structures & Algorithms | 2017-08-10 | Paper |
Acyclic edge colourings of graphs with large girth
Random Structures & Algorithms | 2017-08-10 | Paper |
A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
(available as arXiv preprint) | 2017-07-13 | Paper |
| A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees | 2017-07-13 | Paper |
A probabilistic analysis of Kademlia networks
Algorithms and Computation | 2014-01-14 | Paper |
