English
Related papers

Related papers: The strong circular law: a combinatorial view

200 papers

Let $\zeta = \xi + i\xi'$ where $\xi, \xi'$ are iid copies of a mean zero, variance one, subgaussian random variable. Let $N_n$ be a $n \times n$ random matrix with entries that are iid copies of $\zeta$. We prove that there exists a $c \in…

Probability · Mathematics 2017-10-10 Kyle Luh

Let $M_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are iid Bernoulli random variables (which take value -1 and 1 with probability 1/2). Improving the earlier result by Costello, Tao and Vu, we show that…

Combinatorics · Mathematics 2019-12-19 Hoi H. Nguyen

An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…

Probability · Mathematics 2016-03-25 Radosław Adamczak , Djalil Chafaï , Paweł Wolff

Fix a positive integer $d$ and let $(G_n)_{n\geq1}$ be a sequence of finite abelian groups with orders tending to infinity. For each $n \geq 1$, let $C_n$ be a uniformly random $G_n$-circulant matrix with entries in $\{0,1\}$ and exactly…

Probability · Mathematics 2025-04-21 Adrian Beker

The circular law asserts that the spectral measure of eigenvalues of rescaled random matrices without symmetry assumption converges to the uniform measure on the unit disk. We prove a local version of this law at any point $z$ away from the…

Probability · Mathematics 2013-12-05 Paul Bourgade , Horng-Tzer Yau , Jun Yin

We prove the circular law for a class of non-Hermitian random block band matrices with genuinely sublinear bandwidth. Namely, we show there exists $\tau \in (0,1)$ so that if the bandwidth of the matrix $X$ is at least $n^{1-\tau}$ and the…

Probability · Mathematics 2021-09-01 Vishesh Jain , Indrajit Jana , Kyle Luh , Sean O'Rourke

We consider random $n\times n$ matrices of the form $Y_n=\frac1{\sqrt{d}}A_n\circ X_n$, where $A_n$ is the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices, with $d=\lfloor p n\rfloor$ for some fixed $p \in…

Probability · Mathematics 2017-09-12 Nicholas A. Cook

For fixed $m>1$, we consider $m$ independent $n \times n$ non-Hermitian random matrices $X_1, ..., X_m$ with i.i.d. centered entries with a finite $(2+\eta)$-th moment, $ \eta>0.$ As $n$ tends to infinity, we show that the empirical…

Probability · Mathematics 2014-08-18 Sean O'Rourke , Alexander Soshnikov

Consider a random sum $\eta_1 v_1 + ... + \eta_n v_n$, where $\eta_1,...,\eta_n$ are i.i.d. random signs and $v_1,...,v_n$ are integers. The Littlewood-Offord problem asks to maximize concentration probabilities such as $\P(\eta_1 v_1 + ...…

Probability · Mathematics 2007-05-23 Terence Tao , Van Vu

Let $Q_n$ be a random $n\times n$ matrix with entries in $\{0,1\}$ whose rows are independent vectors of exactly $n/2$ zero components. We show that the smallest singular value $s_n(Q_n)$ of $Q_n$ satisfies \[ \mathbb{P}\Big\{s_n(Q_n)\le…

Probability · Mathematics 2020-11-02 Tuan Tran

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

Probability · Mathematics 2012-11-01 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

We explore the validity of the circular law for random matrices with non i.i.d. entries. Let A be a random n \times n real matrix having as a random vector in R^{n^2} a log-concave isotropic unconditional law. In particular, the entries are…

Probability · Mathematics 2015-07-07 Radosław Adamczak , Djalil Chafai

Let $M_n$ denote a random symmetric $n \times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely…

Probability · Mathematics 2019-09-10 Asaf Ferber , Vishesh Jain

Let $X$ be a matrix sampled uniformly from the set of doubly stochastic matrices of size $n\times n$. We show that the empirical spectral distribution of the normalized matrix $\sqrt{n}(X-{\mathbf {E}}X)$ converges almost surely to the…

Combinatorics · Mathematics 2014-03-28 Hoi H. Nguyen

A well-known conjecture states that a random symmetric $n \times n$ matrix with entries in $\{-1,1\}$ is singular with probability $\Theta\big( n^2 2^{-n} \big)$. In this paper we prove that the probability of this event is at most…

Combinatorics · Mathematics 2020-10-20 Marcelo Campos , Letícia Mattos , Robert Morris , Natasha Morrison

We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to the square root of the spectral radius of the…

Probability · Mathematics 2022-09-29 Johannes Alt , Laszlo Erdos , Torben Krüger

We show that, under some general assumptions on the entries of a random complex $n \times n$ matrix $X_n$, the empirical spectral distribution of $\frac{1}{\sqrt{n}} X_n$ converges to the uniform law of an ellipsoid as $n$ tends to…

Probability · Mathematics 2016-01-29 Hoi Nguyen , Sean O'Rourke

An approximate Spielman-Teng theorem for the least singular value $s_n(M_n)$ of a random $n\times n$ square matrix $M_n$ is a statement of the following form: there exist constants $C,c >0$ such that for all $\eta \geq 0$, $\Pr(s_n(M_n)…

Probability · Mathematics 2019-04-25 Vishesh Jain

Let $A_n$ be an $n\times n$ matrix with iid entries distributed as Bernoulli random variables with parameter $p = p_n$. Rudelson and Tikhomirov, in a beautiful and celebrated paper, show that the distribution of eigenvalues of $A_n \cdot…

Probability · Mathematics 2025-01-09 Ashwin Sah , Julian Sahasrabudhe , Mehtaab Sawhney

Let $\epsilon_1, \dotsc, \epsilon_n$ be i.i.d. Rademacher random variables taking values $\pm 1$ with probability $1/2$ each. Given an integer vector $\boldsymbol{a} = (a_1, \dotsc, a_n)$, its concentration probability is the quantity…

Combinatorics · Mathematics 2019-04-24 Asaf Ferber , Vishesh Jain , Kyle Luh , Wojciech Samotij