32 citations · 135 across the 28 of their papers we have counts for
41 papers
Record-biased permutations and their permuton limit
Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau
In this article, we study a non-uniform distribution on permutations biased by their number of records that we call \emph{record-biased permutations}. We give several generative pr…
Key-avoidance for alternating sign matrices
Mathilde Bouvel, Rebecca Smith, Jessica Striker
We initiate a systematic study of key-avoidance on alternating sign matrices (ASMs) defined via pattern-avoidance on an associated permutation called the \emph{key} of an ASM. We e…
Between weak and Bruhat: the middle order on permutations
Mathilde Bouvel, Luca Ferrari, Bridget Eileen Tenner
We define a partial order on permutations of any given size , which is the image of a natural partial order on inversion sequences. We call this the ``middle ord…
A canonical tree decomposition for order types, and some applications
Mathilde Bouvel, Valentin Féray, Xavier Goaoc +1
We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the c…
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…
A logical limit law for -avoiding permutations
Michael Albert, Mathilde Bouvel, Valentin Féray +1
We prove that the class of 231-avoiding permutations satisfies a logical limit law, i.e. that for any first-order sentence , in the language of two total orders, the probability…