English
Related papers

Related papers: On the smoothed analysis of the smallest singular …

200 papers

We establish, under a moment matching hypothesis, the local universality of the correlation functions associated with products of $M$ independent iid random matrices, as $M$ is fixed, and the sizes of the matrices tend to infinity. This…

Probability · Mathematics 2019-04-25 Phil Kopel , Sean O'Rourke , Van Vu

Let $\Lambda$ be the limiting smallest eigenvalue in the general (\beta, a)-Laguerre ensemble of random matrix theory. Here \beta>0, a >-1; for \beta=1,2,4 and integer a, this object governs the singular values of certain rank n Gaussian…

Probability · Mathematics 2011-11-21 Jose A. Ramirez , Brian Rider , Ofer Zeitouni

Let $K_n$ be the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the numbers $$ c_n={\rm min}\{\lambda\mid \lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

Combinatorics · Mathematics 2020-09-23 Vesa Kaarnioja

Let $A$ be an $n\times n$ matrix with mutually independent centered Gaussian entries. Define \begin{align*} \sigma^*:=\max\limits_{i,j\leq n}\sqrt{{\mathbb E}\,|A_{i,j}|^2}, \quad \sigma:=\max\bigg(\max\limits_{j\leq n}\sqrt{{\mathbb…

Probability · Mathematics 2023-07-26 Konstantin Tikhomirov

Arbitrary matrices $M \in \mathbb{R}^{m \times n}$, randomly perturbed in an additive manner using a random matrix $R \in \mathbb{R}^{m \times n}$, are shown to asymptotically almost surely satisfy the so-called {\sl robust null space…

Probability · Mathematics 2025-07-29 Elad Aigner-Horev , Dan Hefetz , Michael Trushkin

In this note, we show that for each minimal norm $N(\cdot)$ on the algebra $M_n$ of all $n \times n$ complex matrices, there exist norms $\|\cdot\|_1$ and $\|\cdot\|_2$ on ${\mathbb C}^n$ such that $$N(A)=\max\{\|Ax\|_2: \|x\|_1=1, x\in…

Functional Analysis · Mathematics 2015-05-13 Madjid Mirzavaziri , Mohammad Sal Moslehian

Let $A$ be a subset of the cyclic group $\mathbf{Z}/p\mathbf{Z}$ with $p$ prime. It is a well-studied problem to determine how small $|A|$ can be if there is no unique sum in $A+A$, meaning that for every two elements $a_1,a_2\in A$, there…

Combinatorics · Mathematics 2023-09-20 Benjamin Bedert

We show that the spectral radius of an $N\times N$ random symmetric matrix with i.i.d. bounded centered but non-symmetrically distributed entries is bounded from below by $ 2 \*\sigma - o(N^{-6/11+\epsilon}), $ where $\sigma^2 $ is the…

Probability · Mathematics 2008-05-14 Sandrine Peche , Alexander Soshnikov

In this note, we show how to provide sharp control on the least singular value of a certain translated linearization matrix arising in the study of the local universality of products of independent random matrices. This problem was first…

Probability · Mathematics 2020-07-08 Rohit Chaudhuri , Vishesh Jain , Natesh S. Pillai

A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…

Numerical Analysis · Mathematics 2021-06-24 Lennard Kamenski

Lightness and sparsity are two natural parameters for Euclidean $(1+\varepsilon)$-spanners. Classical results show that, when the dimension $d\in \mathbb{N}$ and $\varepsilon>0$ are constant, every set $S$ of $n$ points in $d$-space admits…

Computational Geometry · Computer Science 2022-06-22 Sujoy Bhore , Csaba D. Toth

We study the distribution of the least singular value associated to an ensemble of sparse random matrices. Our motivating example is the ensemble of $N\times N$ matrices whose entries are chosen independently from a Bernoulli distribution…

Probability · Mathematics 2019-01-25 Ziliang Che , Patrick Lopatto

Let $A\in\mathbb{R}^{m\times n}$ be a matrix of rank $r$ with singular value decomposition (SVD) $A=\sum_{k=1}^r\sigma_k (u_k\otimes v_k),$ where $\{\sigma_k, k=1,\ldots,r\}$ are singular values of $A$ (arranged in a non-increasing order)…

Probability · Mathematics 2015-06-10 Vladimir Koltchinskii , Dong Xia

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

Combinatorics · Mathematics 2025-08-08 Vesa Kaarnioja , André-Alexander Zepernick

We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/sqrt{n}). The purpose…

Probability · Mathematics 2008-01-09 Laurent Bruneau , Francois Germinet

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 $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independent copies of $X$. We show that under mild assumptions on $\|X\|_2$ (a suitable thin-shell bound) and on the tail-decay of the marginals…

Functional Analysis · Mathematics 2022-07-13 Daniel Bartl , Shahar Mendelson

In this paper we give a generalization of the discrete complex-valued random variable defined and investigated in \cite{ssa} and \cite{m8}. We prove the statements concerning the expressions for the excepted value and the variance of this…

Signal Processing · Electrical Eng. & Systems 2018-07-05 Romeo Meštrović

Lower bounds on the smallest eigenvalue of a symmetric positive definite matrices $A\in\mathbb{R}^{m\times m}$ play an important role in condition number estimation and in iterative methods for singular value computation. In particular, the…

Numerical Analysis · Computer Science 2017-02-02 Yusaku Yamamoto

Let $\mathbf X$ be a random matrix whose pairs of entries $X_{jk}$ and $X_{kj}$ are correlated and vectors $ (X_{jk},X_{kj})$, for $1\le j<k\le n$, are mutually independent. Assume that the diagonal entries are independent from off-diagonal…

Probability · Mathematics 2013-09-24 Friedrich Götze , Alexey Naumov , Alexander Tikhomirov
‹ Prev 1 3 4 5 6 7 10 Next ›