activity
20072026
most citedGaussian fluctuations of Young diagrams and structure constants of Jack characters

59 citations · 198 across the 14 of their papers we have counts for

collaborators
Showing math.PRShow all

9 papers · 1 filter

math.PR2026

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…

math.PR2022

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:…

math.PR2022★ 3 cited

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…

math.PR2021

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…

math.PR2019

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 $…

math.PR2019★ 20 cited

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…

math.PR2016

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…

math.PR2016

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…

math.PR2014★ 59 cited

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…