1 citations · 2 across the 5 of their papers we have counts for
3 papers · 1 filter
Large deviation principles for pattern-avoiding permutations, and limit shapes for constrained Mallows permutations
Thomas Budzinski, Victor Dubach, Valentin Féray +2
We study Mallows random permutations conditioned to avoid a given pattern of length~. When the bias parameter is of the form , we prove that these permutations conv…
Binary search trees of permuton samples
Benoît Corsini, Victor Dubach, Valentin Féray
Binary search trees (BST) are a popular type of data structure when dealing with ordered data. Indeed, they enable one to access and modify data efficiently, with their height corr…
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…