English
Related papers

Related papers: Sparse matrices: convergence of the characteristic…

200 papers

We study Poisson--Voronoi percolation and its discrete analogue Bernoulli--Voronoi percolation in spaces with a non-amenable product structure. We develop a new method of proving smallness of the uniqueness threshold $p_u(\lambda)$ at small…

Probability · Mathematics 2025-12-01 Matteo D'Achille , Jan Grebík , Ali Khezeli , Konstantin Recke , Amanda Wilkens

We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random matrices that includes the normalized adjacency matrices of the Erd{\H o}s-R{\'e}nyi graph $G(N,p)$. Recently, it was shown by Lee, up to an…

Probability · Mathematics 2023-05-05 Jiaoyang Huang , Horng-Tzer Yau

We study the statistics of the largest eigenvalues of $p \times p$ sample covariance matrices $\Sigma_{p,n} = M_{p,n}M_{p,n}^{*}$ when the entries of the $p \times n$ matrix $M_{p,n}$ are sparse and have a distribution with tail…

Probability · Mathematics 2015-06-23 Antonio Auffinger , Si Tang

Motivated by problems from compressed sensing, we determine the threshold behavior of a random $n\times d$ $\pm 1$ matrix $M_{n,d}$ with respect to the property "every $s$ columns are linearly independent". In particular, we show that for…

Combinatorics · Mathematics 2023-02-14 Asaf Ferber , Ashwin Sah , Mehtaab Sawhney , Yizhe Zhu

We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random matrices that includes the normalized adjacency matrices of the Erd\H{o}s-R\'enyi graph $G(N,p)$. Tracy-Widom fluctuations of the extreme…

Probability · Mathematics 2017-12-12 Jiaoyang Huang , Benjamin Landon , Horng-Tzer Yau

We study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subsets of columns of a…

Information Theory · Computer Science 2015-12-21 Ramji Venkataramanan , Antony Joseph , Sekhar Tatikonda

We consider a class of sparse random matrices which includes the adjacency matrix of the Erd\H{o}s-R\'enyi graph $\mathcal{G}(N,p)$. We show that if $N^{\varepsilon} \leq Np \leq N^{1/3-\varepsilon}$ then all nontrivial eigenvalues away…

Probability · Mathematics 2021-04-07 Yukun He , Antti Knowles

Let $\mu$ be a probability measure in $\mathbb{C}$ with a continuous and compactly supported density function, let $z_1, \dots, z_n$ be independent random variables, $z_i \sim \mu$, and consider the random polynomial $$ p_n(z) =…

Probability · Mathematics 2019-04-12 Stefan Steinerberger , Hau-tieng Wu

We investigate the average characteristic polynomial $\mathbb E\big[\prod_{i=1}^N(z-x_i)\big] $ where the $x_i$'s are real random variables which form a determinantal point process associated to a bounded projection operator. For a subclass…

Probability · Mathematics 2015-01-08 Adrien Hardy

In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…

Disordered Systems and Neural Networks · Physics 2025-06-17 C. T Martínez Martínez , J. A. Méndez Bermúdez

We consider a sequence of polynomials $\{P_n\}_{n \geq 0}$ satisfying a special $R_{II}$ type recurrence relation where the zeros of $P_n$ are simple and lie on the real line. It turns out that the polynomial $P_n$, for any $n \geq 2$, is…

Classical Analysis and ODEs · Mathematics 2017-03-16 Mourad E. H. Ismail , Alagacone Sri Ranga

Let $X_{m} = G_{1}\ldots G_{m}$ denote the product of $m$ independent random matrices of size $N \times N$, with each matrix in the product consisting of independent standard Gaussian variables. Denoting by $N_{\mathbb{R}}(m)$ the total…

Probability · Mathematics 2017-02-01 Nick Simm

We prove that the local eigenvalue statistics in the bulk for complex random matrices with independent entries whose $r$-th absolute moment decays as $N^{-1-(r-2)\epsilon}$ for some $\epsilon>0$ are universal. This includes sparse matrices…

Probability · Mathematics 2025-08-06 Mohammed Osman

We consider eigenvectors of adjacency matrices of Erd\H{o}s-R\'{e}nyi graphs and study the variation of their directions by resampling the entries randomly. Let $\mathbf{v}$ be the eigenvector associated with the second-largest eigenvalue…

Probability · Mathematics 2021-06-21 Jaehun Lee

Recently, a class of algorithms combining classical fixed point iterations with repeated random sparsification of approximate solution vectors has been successfully applied to eigenproblems with matrices as large as $10^{108} \times…

Numerical Analysis · Mathematics 2025-04-28 Jonathan Weare , Robert J. Webber

We equip the polytope of $n\times n$ Markov matrices with the normalized trace of the Lebesgue measure of $\mathbb{R}^{n^2}$. This probability space provides random Markov matrices, with i.i.d. rows following the Dirichlet distribution of…

Probability · Mathematics 2010-06-16 Djalil Chafai

Let $A=(a_{ij})$ be an $n\times n$ random matrix with i.i.d. entries such that $\mathbb{E} a_{11} = 0$ and $\mathbb{E} {a_{11}}^2 = 1$. We prove that for any $\delta>0$ there is $L>0$ depending only on $\delta$, and a subset $\mathcal{N}$…

Probability · Mathematics 2017-02-16 Elizaveta Rebrova , Konstantin Tikhomirov

We consider the spectrum of random Laplacian matrices of the form $L_n=A_n-D_n$ where $A_n$ is a real symmetric random matrix and $D_n$ is a diagonal matrix whose entries are equal to the corresponding row sums of $A_n$. If $A_n$ is a…

Probability · Mathematics 2022-12-07 Andrew Campbell , Sean O'Rourke

We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the…

Probability · Mathematics 2019-02-05 Reda Chhaibi , Emma Hovhannisyan , Joseph Najnudel , Ashkan Nikeghbali , Brad Rodgers

In classical random matrix theory the Gaussian and chiral Gaussian random matrix models with a source are realized as shifted mean Gaussian, and chiral Gaussian, random matrices with real $(\beta = 1)$, complex ($\beta = 2)$ and real…

Probability · Mathematics 2015-06-16 Peter J. Forrester