English
Related papers

Related papers: The smallest singular value for rectangular random…

200 papers

We investigate two-sided bounds for operator norms of random matrices with unhomogenous independent entries. We formulate a lower bound for Rademacher matrices and conjecture that it may be reversed up to a universal constant. We show that…

Probability · Mathematics 2024-05-24 Rafał Latała , Witold Świątkowski

We study the deviation inequality for the spectral norm of structured random matrices with non-gaussian entries. In particular, we establish an optimal bound for the $p$-th moment of the spectral norm by transfering the spectral norm into…

Probability · Mathematics 2024-05-14 Guozheng Dai , Zhonggen Su

Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum.…

Probability · Mathematics 2012-03-27 Charles Bordenave , Pietro Caputo , Djalil Chafai

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 a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ with upper triangular entries being independent identically distributed random variables with mean zero and unit variance. We additionally suppose that $\mathbb E…

Probability · Mathematics 2016-12-01 Friedrich Götze , Alexey Naumov , Alexander Tikhomirov

We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \times d$ matrices $A_1,\ldots,A_n$ each with $\|A_i\|_{\mathsf{op}} \leq 1$ and rank at most $n/\log^3 n$, one can efficiently find…

Data Structures and Algorithms · Computer Science 2022-08-30 Nikhil Bansal , Haotian Jiang , Raghu Meka

We present a non-asymptotic concentration inequality for the random matrix product \begin{equation}\label{eq:Zn} Z_n = \left(I_d-\alpha X_n\right)\left(I_d-\alpha X_{n-1}\right)\cdots \left(I_d-\alpha X_1\right), \end{equation} where…

Probability · Mathematics 2020-08-20 Sina Baghal

In many practical situations we would like to estimate the covariance matrix of a set of variables from an insufficient amount of data. More specifically, if we have a set of $N$ independent, identically distributed measurements of an $M$…

Probability · Mathematics 2010-10-05 Thomas L. Marzetta , Gabriel H. Tucci , Steven H. Simon

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

Consider a square matrix with independent and identically distributed entries of zero mean and unit variance. It is well known that if the entries have a finite fourth moment, then, in high dimension, with high probability, the spectral…

Combinatorics · Mathematics 2018-05-31 Charles Bordenave , Pietro Caputo , Djalil Chafai , Konstantin Tikhomirov

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

This paper studies the problem of selecting a submatrix of a positive definite matrix in order to achieve a desired bound on the smallest eigenvalue of the submatrix. Maximizing this smallest eigenvalue has applications to selecting input…

Systems and Control · Computer Science 2017-09-08 Andrew Clark , Qiqiang Hou , Linda Bushnell , Radha Poovendran

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 prove lower bounds for the smallest singular value of rectangular, multivariate Vandermonde matrices with nodes on the complex unit circle. The nodes are ``off the grid'', groups of nodes cluster, and the studied minimal singular value…

Numerical Analysis · Mathematics 2019-07-17 Stefan Kunis , Dominik Nagel

Let $X=(X_1,X_2, X_3)$ be a Gaussian random vector such that $X\sim \mathcal{N} (0,\Sigma)$. We consider the problem of determining the matrix $\Sigma$, up to permutation, based on the knowledge of the distribution of…

Probability · Mathematics 2016-04-12 Ricardo Restrepo , Carlos Marín , Jose Solano

Litvak (2018) conjectured that, for any $p > 0$, the quantity $\mathbb{E}[\min_{i = 1}^n |g_i|^p]$ where $g \sim \mathcal{N}(0, \Sigma)$ is a centered Gaussian random vector is minimized among $n \times n$ correlation matrices $\Sigma$ by…

Probability · Mathematics 2026-05-05 Dmitriy Kunisky

Let $M_n$ be an $n\times n$ signed random combinatorial matrix whose rows are independent and uniformly distributed over the set of $\{-1,0,1\}$-vectors with exactly $n/2$ zero coordinates. Despite the dependence induced by the row…

Probability · Mathematics 2026-04-14 Kexin Yu

In this work we study symmetric random matrices with variance profile satisfying certain conditions. We establish the convergence of the operator norm of these matrices to the largest element of the support of the limiting empirical…

Probability · Mathematics 2024-04-23 Dimitris Cheliotis , Michail Louvaris

Consider the empirical spectral distribution of complex random $n\times n$ matrix whose entries are independent and identically distributed random variables with mean zero and variance $1/n$. In this paper, via applying potential theory in…

Probability · Mathematics 2007-06-13 Guangming Pan , Wang Zhou

In this paper we consider the problem of computing the likelihood of the profile of a discrete distribution, i.e., the probability of observing the multiset of element frequencies, and computing a profile maximum likelihood (PML)…

Data Structures and Algorithms · Computer Science 2020-04-07 Nima Anari , Moses Charikar , Kirankumar Shiragur , Aaron Sidford
‹ Prev 1 4 5 6 7 8 10 Next ›