467 citations
- École Normale Supérieure de LyonFR399 papers
- Centre National de la Recherche ScientifiqueFR239 papers
- Université de LyonFR25 papers
- Laboratoire de Mathématiques d'OrsayFR22 papers
- Lyon 1 UniversitéFR21 papers
- Sorbonne UniversitéFR21 papers
- Université Paris CitéFR20 papers
- Département de mathématiques et applicationsFR19 papers
- École Normale Supérieure - PSLFR19 papers
- Institut national de recherche en sciences et technologies du numériqueFR19 papers
- Université Paris-SaclayFR18 papers
- Institut Camille JordanFR17 papers
105 papers · 1 filter
The longest increasing subsequence of Brownian separable permutons
Arka Adhikari, Jacopo Borga, Thomas Budzinski +2
We establish a scaling limit result for the length of the longest increasing subsequence of a permutation of size sampled from the Brownian sepa…
Ergodicity of the Anderson model
Hugo Eulry, Antoine Mouzard
We consider the parabolic stochastic quantization equation associated to the model on the torus in a spatial white noise environment. We study the long time behavior of thi…
Global law of conjugate kernel random matrices with heavy-tailed weights
Alice Guionnet, Vanessa Piccolo
We study the asymptotic spectral distribution of the conjugate kernel random matrix , where arises from a two-layer neural network model. We consider the settin…
Operator norm of products of random matrices
Jean-Christophe Mourrat
We study the operator norm of products of independent random matrices with independent and identically distributed entries. For -by- matrices wh…
There are no geodesic hubs in the Brownian sphere
Mathieu Mourichoux
A point of a metric space is called a -hub if it is the endpoint of exactly disjoint geodesics, and that the concatenation of any two of these paths is still a geodesic. We…
The critical Karp--Sipser core of Erdős--Rényi random graphs
Thomas Budzinski, Alice Contat
The Karp--Sipser algorithm consists in removing recursively the leaves as well their unique neighbours and all isolated vertices of a given graph. The remaining graph obtained when…