English
Related papers

Related papers: Quantitative Tracy-Widom laws for sparse random ma…

200 papers

We study the statistics of the largest eigenvalue lambda_max of N x N random matrices with unit variance, but power-law distributed entries, P(M_{ij})~ |M_{ij}|^{-1-mu}. When mu > 4, lambda_max converges to 2 with Tracy-Widom fluctuations…

Statistical Mechanics · Physics 2015-06-25 Giulio Biroli , Jean-Philippe Bouchaud , Marc Potters

In this work, we obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the "spectrum" of partitions of a large integer n (under the Plancherel measure). More specifically, we show that,…

Probability · Mathematics 2007-05-23 L. V. Bogachev , Z. G. Su

In this paper, we study the smallest non-zero eigenvalue of the sample covariance matrices $\mathcal{S}(Y)=YY^*$, where $Y=(y_{ij})$ is an $M\times N$ matrix with iid mean $0$ variance $N^{-1}$ entries. We prove a phase transition for its…

Probability · Mathematics 2023-11-09 Zhigang Bao , Jaehun Lee , Xiaocong Xu

We study an oriented first passage percolation model for the evolution of a river delta. This model is exactly solvable and occurs as the low temperature limit of the beta random walk in random environment. We analyze the asymptotics of an…

Probability · Mathematics 2021-08-05 Guillaume Barraquand , Mark Rychnovsky

We analyze the spectral properties of the high-dimensional random geometric graph $G(n, d, p)$, formed by sampling $n$ i.i.d vectors $\{v_i\}_{i=1}^{n}$ uniformly on a $d$-dimensional unit sphere and connecting each pair $\{i,j\}$ whenever…

Probability · Mathematics 2026-02-11 Yifan Cao , Yizhe Zhu

We prove that the free energy of the log-gamma polymer between lattice points $(1,1)$ and $(M,N)$ converges to the GUE Tracy-Widom distribution in the $M^{1/3}$ scaling, provided that $N/M$ remains bounded away from zero and infinity. We…

Probability · Mathematics 2020-12-24 Guillaume Barraquand , Ivan Corwin , Evgeni Dimitrov

Consider an ensemble of $N\times N$ non-Hermitian matrices in which all entries are independent identically distributed complex random variables of mean zero and absolute mean-square one. If the entry distributions also possess bounded…

Probability · Mathematics 2007-05-23 B. Rider , Jack W. Silverstein

The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erd\H{o}s--R\'enyi random graph, called $W$-random graphs. We prove, via the method of moments, a limit theorem for the number…

Combinatorics · Mathematics 2021-11-16 Jan Hladky , Christos Pelekis , Matas Sileikis

Traces of large powers of real-valued Wigner matrices are known to have Gaussian fluctuations: for $A=\frac{1}{\sqrt{n}}(a_{ij})_{1 \leq i,j \leq n}\in \mathbb{R}^{n \times n}, A=A^T$ with $(a_{ij})_{1 \leq i \leq j \leq n}$ i.i.d.,…

Probability · Mathematics 2024-12-24 Simona Diaconu

Enriquez, Faraud, and Lemaire (2023) have established process-level fluctuations for the giant of the dynamic Erd\H{o}s-R\'{e}nyi random graph above criticality and show that the limit is a centered Gaussian process with continuous sample…

Probability · Mathematics 2025-01-03 David Clancy

Smooth linear statistics of random permutation matrices, sampled under a general Ewens distribution, exhibit an interesting non-universality phenomenon. Though they have bounded variance, their fluctuations are asymptotically non-Gaussian…

Probability · Mathematics 2011-06-13 Gérard Ben Arous , Kim Dang

The correlated Erd\"os-R\'enyi random graph ensemble is a probability law on pairs of graphs with $n$ vertices, parametrized by their average degree $\lambda$ and their correlation coefficient $s$. It can be used as a benchmark for the…

Disordered Systems and Neural Networks · Physics 2024-11-21 Andrea Muratori , Guilhem Semerjian

We consider $N\times N$ Hermitian random matrices with i.i.d. entries. The matrix is normalized so that the average spacing between consecutive eigenvalues is of order $1/N$. We study the connection between eigenvalue statistics on…

Mathematical Physics · Physics 2009-06-25 László Erdős , Benjamin Schlein , Horng-Tzer Yau

For Erd\H{o}s-R\'enyi random graphs with average degree $\gamma$, and uniformly random $\gamma$-regular graph on $n$ vertices, we prove that with high probability the size of both the Max-Cut and maximum bisection are…

Probability · Mathematics 2017-04-04 Amir Dembo , Andrea Montanari , Subhabrata Sen

It was conjectured by Alon and proved by Friedman that a random $d$-regular graph has nearly the largest possible spectral gap, more precisely, the largest absolute value of the non-trivial eigenvalues of its adjacency matrix is at most…

Combinatorics · Mathematics 2019-03-07 Charles Bordenave

We consider the q-Hahn TASEP which is a three-parameter family of discrete time interacting particle systems. The particles jump to the right independently according to a certain q-Binomial distribution with parallel updates. It is a…

Probability · Mathematics 2019-05-20 Bálint Vető

Let $\mathcal{G}(N,\frac 1Nt_N)$ be the Erd\H{o}s-R\'enyi graph with connection probability $\frac 1Nt_N\sim t/N$ as $N\to\infty$ for a fixed $t\in(0,\infty)$. We derive a large-deviations principle for the empirical measure of the sizes of…

Probability · Mathematics 2021-04-26 Luisa Andreis , Wolfgang König , Robert I. A. Patterson

In this article, the joint fluctuations of the extreme eigenvalues and eigenvectors of a large dimensional sample covariance matrix are analyzed when the associated population covariance matrix is a finite-rank perturbation of the identity…

Information Theory · Computer Science 2012-06-20 Romain Couillet , Walid Hachem

We show that in a general \cal{N} = 1 supergravity with N \gg 1 scalar fields, an exponentially small fraction of the de Sitter critical points are metastable vacua. Taking the superpotential and Kahler potential to be random functions, we…

High Energy Physics - Theory · Physics 2015-06-03 David Marsh , Liam McAllister , Timm Wrase

For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…

Combinatorics · Mathematics 2013-09-04 Nikolaos Fountoulakis , Ross J. Kang , Colin McDiarmid