English
Related papers

Related papers: Quantitative invertibility of random matrices: a c…

200 papers

We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant $z\in\mathbb{C}$. We prove an optimal lower tail estimate on this singular value in the critical regime where…

Probability · Mathematics 2022-11-02 Giorgio Cipolloni , László Erdős , Dominik Schröder

Let $M$ be an arbitrary $n$ by $n$ matrix. We study the condition number a random perturbation $M+N_n$ of $M$, where $N_n$ is a random matrix. It is shown that, under very general conditions on $M$ and $M_n$, the condition number of $M+N_n$…

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

The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to…

Functional Analysis · Mathematics 2014-03-05 Mark Rudelson , Roman Vershynin

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

Consider a random $n\times n$ zero-one matrix with "density" $p$, sampled according to one of the following two models: either every entry is independently taken to be one with probability $p$ (the "Bernoulli" model), or each row is…

Combinatorics · Mathematics 2021-04-22 Asaf Ferber , Matthew Kwan , Lisa Sauermann

We present a simple solution to a question posed by Candes, Romberg and Tao on the uniform uncertainty principle for Bernoulli random matrices. More precisely, we show that a rectangular k*n random subgaussian matrix (with k < n) has the…

Statistics Theory · Mathematics 2007-06-13 Shahar Mendelson , Alain Pajor , Nicole Tomczak-Jaegermann

Let $p \in (0,1/2)$ be fixed, and let $B_n(p)$ be an $n\times n$ random matrix with i.i.d. Bernoulli random variables with mean $p$. We show that for all $t \ge 0$, \[\mathbb{P}[s_n(B_n(p)) \le tn^{-1/2}] \le C_p t + 2n(1-p)^{n} + C_p…

Probability · Mathematics 2021-05-07 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Let $A$ be a $n \times n$ symmetric matrix with $(A_{i,j})_{i\leq j} $, independent and identically distributed according to a subgaussian distribution. We show that $$\mathbb{P}(\sigma_{\min}(A) \leq \varepsilon/\sqrt{n}) \leq C…

Probability · Mathematics 2023-10-24 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a regular (aperiodic and irreducible) finite Markov chain. Specially, consider a random walk on a regular Markov chain and a Hermitian matrix-valued…

Machine Learning · Statistics 2020-10-30 Jiezhong Qiu , Chi Wang , Ben Liao , Richard Peng , Jie Tang

We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a…

Probability · Mathematics 2024-12-13 Ioana Dumitriu , Yizhe Zhu

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

Probability · Mathematics 2021-06-09 Asaf Ferber , Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…

Data Structures and Algorithms · Computer Science 2025-09-29 Aditya Bhaskara , Eric Evert , Vaidehi Srinivas , Aravindan Vijayaraghavan

We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we…

Functional Analysis · Mathematics 2007-05-23 Vladimir Nikiforov

For positive integers $1 \leq k \leq n$ let $M_n$ be the algebra of all $n \times n$ complex matrices and $M_n^{\le k}$ its subset consisting of all matrices of rank at most $k$. We first show that whenever $k>\frac{n}{2}$, any continuous…

Spectral Theory · Mathematics 2025-07-10 Alexandru Chirvasitu , Ilja Gogić , Mateo Tomašević

In this paper, we consider the singular values and singular vectors of finite, low rank perturbations of large rectangular random matrices. Specifically, we prove almost sure convergence of the extreme singular values and appropriate…

Probability · Mathematics 2012-01-27 Florent Benaych-Georges , Raj Rao Nadakuditi

In this note we describe the singular locus of diagonally-dominant Hermitian matrices with nonnegative diagonal entries over the reals, the complex numbers, and the quaternions. This yields explicit expressions for the probability that such…

Probability · Mathematics 2014-03-07 Adrien Kassel

In a recent work [2] with Datta, we introduced the mu vector (with respect to a given field) of simplicial complexes and used it to study tightness and lower bounds. In this paper, we modify the definition of mu vectors. With the new…

Geometric Topology · Mathematics 2014-05-23 Bhaskar Bagchi

For fixed positive integers m, we consider the product of m independent n by n random matrices with iid entries as in the limit as n tends to infinity. Under suitable assumptions on the entries of each matrix, it is known that the limiting…

Probability · Mathematics 2017-11-21 Natalie Coston , Sean O'Rourke , Philip Matchett Wood

We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix…

Probability · Mathematics 2018-12-17 Anirban Basak , Elliot Paquette , Ofer Zeitouni

Consider a quadratic polynomial $Q(\xi_{1},\dots,\xi_{n})$ of independent Rademacher random variables $\xi_{1},\dots,\xi_{n}$. To what extent can $Q(\xi_{1},\dots,\xi_{n})$ concentrate on a single value? This quadratic version of the…

Combinatorics · Mathematics 2023-12-22 Matthew Kwan , Lisa Sauermann