10 citations · 11 across the 7 of their papers we have counts for
14 papers
The average-case complexity of the Word Problem for groups of matrices over is linear
Frédérique Bassino, Cyril Nicaud, Pascal Weil
We show that the Word Problem in finitely generated subgroups of can be solved in linear average-case complexity. This is done under the bit-complexity…
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…
Silhouettes and generic properties of subgroups of the modular group
Frédérique Bassino, Cyril Nicaud, Pascal Weil
We show that the probability for a finitely generated subgroup of the modular group, of size , to be almost malnormal or non-parabolic, tends to 0 as tends to infinity -- wh…
Random generation of subgroups of the modular group with a fixed isomorphism type
Frédérique Bassino, Cyril Nicaud, Pascal Weil
We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group of a given isomorphism type. The me…
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…