1 citations · 3 across the 8 of their papers we have counts for
13 papers
Percolation on grandparent graphs of Bienaymé trees
Laurent Ménard, Delphin Sénizergues
We consider Bernoulli bond percolation on the grandparent graph of a Bienaymé tree, obtained by adding to the tree an edge between every vertex and its grandparent. We show that th…
The longest increasing subsequence of Brownian separable permutons
Arka Adhikari, Jacopo Borga, Thomas Budzinski +2
We establish a scaling limit result for the length of the longest increasing subsequence of a permutation of size sampled from the Brownian sepa…
The height of the infection tree
Emmanuel Kammerer, Igor Kortchemski, Delphin Sénizergues
We are interested in the geometry of the ``infection tree'' in a stochastic SIR (Susceptible-Infectious-Recovered) model, starting with a single infectious individual. This tree is…
Total disconnectedness and percolation for the supports of super-tree random measures
Edwin Perkins, Delphin Sénizergues
Super-tree random measures (STRMs) were introduced by Allouba, Durrett, Hawkes and Perkins as a simple stochastic model which emulates a superprocess at a fixed time. A STRM ar…
The scaling limit of the root component in the Wired Minimal Spanning Forest of the Poisson Weighted Infinite Tree
Omer Angel, Delphin Sénizergues
In this paper we prove a scaling limit result for the component of the root in the Wired Minimal Spanning Forest (WMSF) of the Poisson-Weighted Infinite Tree (PWIT), where the latt…
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…
Decorated stable trees
Delphin Sénizergues, Sigurdur Örn Stefánsson, Benedikt Stufler
We define decorated -stable trees which are informally obtained from an -stable tree by blowing up its branchpoints into random metric spaces. This generalizes the -stable…
Height of weighted recursive trees with sub-polynomially growing total weight
Michel Pain, Delphin Sénizergues
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen at random with probability p…
Correction terms for the height of weighted recursive trees
Michel Pain, Delphin Sénizergues
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to i…
Growing random graphs with a preferential attachment structure
Delphin Sénizergues
The aim of this paper is to develop a method for proving almost sure convergence in Gromov-Hausodorff-Prokhorov topology for a class of models of growing random graphs that general…
Geometry of weighted recursive and affine preferential attachment trees
Delphin Sénizergues
We study two models of growing recursive trees. For both models, initially the tree only contains one vertex and at each time a new vertex is added to the tre…
Stable graphs: distributions and line-breaking construction
Christina Goldschmidt, Bénédicte Haas, Delphin Sénizergues
For , the -stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given -dependent power-law tail behavior. It…
Random gluing of metric spaces
Delphin Sénizergues
We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constr…