32 citations · 49 across the 13 of their papers we have counts for
20 papers
Dense and nondense limits for uniform random intersection graphs
Frédérique Bassino, Mathilde Bouvel, Valentin Féray +2
We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first f…
The Ulam-Hammersley problem for multiset permutations
Lucas Gerin
We obtain the asymptotic behaviour of the longest increasing/non-decreasing subsequences in a random uniform multiset permutation in which each element in {1,...,n} occurs k times,…
Scaling limit of graph classes through split decomposition
Frédérique Bassino, Mathilde Bouvel, Valentin Féray +2
We prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhorov topology, of uniform random graphs in each of the three following families of graphs:…
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
Frédérique Bassino, Mathilde Bouvel, Michael Drmota +4
This paper is interested in independent sets (or equivalently, cliques) in uniform random cographs. We also study their permutation analogs, namely, increasing subsequences in unif…
Longest increasing paths with Lipschitz constraints
Anne-Laure Basdevant, Lucas Gerin
The Hammersley problem asks for the maximal number of points in a monotonous path through a Poisson point process. It is exactly solvable and notoriously known to belong to the KPZ…
Random cographs: Brownian graphon limit and asymptotic degree distribution
Frédérique Bassino, Mathilde Bouvel, Valentin Féray +3
We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphon…