59 citations · 198 across the 14 of their papers we have counts for
19 papers
The Aldous chain on cladograms mixes in order steps
Valentin Féray, Lucas Teyssier
Cladograms of size are unrooted binary trees whose leaves are labelled from 1 to . Aldous introduced in 2000 a Markov chain on cladograms, a step of which consists of removi…
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…
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:…
Components in meandric systems and the infinite noodle
Valentin Féray, Paul Thévenin
We investigate here the asymptotic behaviour of a large typical meandric system. More precisely, we show the quenched local convergence of a random uniform meandric system on…
Random generation and scaling limits of fixed genus factorizations into transpositions
Valentin Féray, Baptiste Louf, Paul Thévenin
We study the asymptotic behaviour of random factorizations of the -cycle into transpositions of fixed genus . They have a geometric interpretation as branched covers of the…
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…
On the central limit theorem for the two-sided descent statistics in Coxeter groups
Valentin Féray
In 2018, Kahle and Stump raised the following problem: identify sequences of finite Coxeter groups for which the two-sided descent statistics on a uniform random element of $…
A decorated tree approach to random permutations in substitution-closed classes
Jacopo Borga, Mathilde Bouvel, Valentin Féray +1
We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permut…
Central limit theorems for patterns in multiset permutations and set partitions
Valentin Féray
We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and i…
Weighted dependency graphs
Valentin Féray
The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dep…
The Brownian limit of separable permutations
Frédérique Bassino, Mathilde Bouvel, Valentin Féray +2
We study random uniform permutations in an important class of pattern-avoiding permutations: the separable permutations. We describe the asymptotics of the number of occurrences of…
On the combinatorial local log-concavity conjecture and a result of Stanley
Valentin Féray
The purpose of this note is to explain that the combinatorial local log-concavity conjecture introduced by Gross, Mansour, Tucker and Wang (Eur. J. Comb. 52, 207-222, 2016) in fact…
Super quasi-symmetric functions via Young diagrams
Jean-Christophe Aval, Valentin Féray, Jean-Christophe Novelli +1
We consider the multivariate generating series of -partitions in infinitely many variables . For some family of ranked posets , it is natural to consi…
Gaussian fluctuations of Young diagrams and structure constants of Jack characters
Maciej Dołęga, Valentin Féray
In this paper, we consider a deformation of Plancherel measure linked to Jack polynomials. Our main result is the description of the first and second-order asymptotics of the bulk…
An edge-weighted hook formula for labelled trees
Valentin Féray, I. P. Goulden, A. Lascoux
A number of hook formulas and hook summation formulas have previously appeared, involving various classes of trees. One of these classes of trees is rooted trees with labelled vert…
Jack polynomials and orientability generating series of maps
Maciej Dołęga, Valentin Féray, Piotr Śniady
We study Jack characters, which are the coefficients of the power-sum expansion of Jack symmetric functions with a suitable normalization. These quantities have been introduced by…
Characters of symmetric groups in terms of free cumulants and Frobenius coordinates
Maciej Dołega, Valentin Féray, Piotr Śniady
Free cumulants are nice and useful functionals of the shape of a Young diagram, in particular they give the asymptotics of normalized characters of symmetric groups S(n) in the lim…
Explicit combinatorial interpretation of Kerov character polynomials as numbers of permutation factorizations
Maciej Dołega, Valentin Féray, Piotr Sniady
We find an explicit combinatorial interpretation of the coefficients of Kerov character polynomials which express the value of normalized irreducible characters of the symmetric gr…
Asymptotics of characters of symmetric groups related to Stanley character formula
Valentin Féray, Piotr Sniady
We prove an upper bound for characters of the symmetric groups. Namely, we show that there exists a constant a>0 with a property that for every Young diagram λwith n boxes, r(λ) ro…