32 citations · 60 across the 12 of their papers we have counts for
19 papers
The critical Karp--Sipser core of Erdős--Rényi random graphs
Thomas Budzinski, Alice Contat
The Karp--Sipser algorithm consists in removing recursively the leaves as well their unique neighbours and all isolated vertices of a given graph. The remaining graph obtained when…
Local limits of random bipartite maps in high genus: the general case
Thomas Budzinski
We prove the local convergence of uniform bipartite maps with prescribed face degrees in the high genus regime. Unlike in the previous work arxiv:2012.05813 on the subject, we do n…
Distances and isoperimetric inequalities in random triangulations of high genus
Thomas Budzinski, Guillaume Chapuy, Baptiste Louf
We prove that uniform random triangulations whose genus is proportional to their size have diameter of order with high probability. We also show that in such triangula…
Maximum Agreement Subtrees and Hölder homeomorphisms between Brownian trees
Thomas Budzinski, Delphin Sénizergues
We prove that the size of the largest common subtree between two uniform, independent, leaf-labelled random binary trees of size is typically less than fo…
The critical Karp--Sipser core of random graphs
Thomas Budzinski, Alice Contat, Nicolas Curien
We study the Karp--Sipser core of a random graph made of a configuration model with vertices of degree and . This core is obtained by recursively removing the leaves as we…
On Cheeger constants of hyperbolic surfaces
Thomas Budzinski, Nicolas Curien, Bram Petri
It is a well-known result due to Bollobas that the maximal Cheeger constant of large -regular graphs cannot be close to the Cheeger constant of the -regular tree. We prove an…