activity
20072019
most citedA simple model of trees for unicellular maps

52 citations · 168 across the 15 of their papers we have counts for

collaborators

21 papers

math.CO2019

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…

math.PR2019★ 3 cited

Scaling limits of permutation classes with a finite specification: a dichotomy

Frédérique Bassino, Mathilde Bouvel, Valentin Féray +3

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) al…

math.PR2018

Trajectories in random minimal transposition factorizations

Valentin Féray, Igor Kortchemski

We study random typical minimal factorizations of the -cycle, which are factorizations of as a product of transpositions, chosen uniformly at random. Our m…

math.CO2018

Two first-order logics of permutations

Michael Albert, Mathilde Bouvel, Valentin Féray

We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or se…

math.PR2017★ 8 cited

Graphons, permutons and the Thoma simplex: three mod-Gaussian moduli spaces

Valentin Féray, Pierre-Loïc Méliot, Ashkan Nikeghbali

In this paper, we show how to use the framework of mod-Gaussian convergence in order to study the fluctuations of certain models of random graphs, of random permutations and of ran…

math.PR2017

The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees

Valentin Féray, Igor Kortchemski

We study random typical minimal factorizations of the -cycle into transpositions, which are factorizations of as a product of transpositions. By viewing tr…