English
Related papers

Related papers: Restricted Eigenvalue Conditions on Subgaussian Ra…

200 papers

The purpose of this paper is to establish sufficient conditions for closed range estimates on $(0,q)$-forms, for some fixed $q$, $1 \leq q \leq n-1$, for $\bar\partial_b$ in both $L^2$ and $L^2$-Sobolev spaces in embedded, not necessarily…

Complex Variables · Mathematics 2019-04-25 Joel Coacalle , Andrew Raich

Random matrix models consisting of normal matrices, defined by the sole constraint $[N^{\dag},N]=0$, will be explored. It is shown that cubic eigenvalue repulsion in the complex plane is universal with respect to the probability…

Statistical Mechanics · Physics 2009-10-28 Gary Oas

We consider the problem of generating pseudo-random matrices based on the similarity of their spectra to Wigner's semicircular law. We introduce the notion of an r-independent pseudo-Wigner matrix ensemble and prove closeness of the spectra…

Information Theory · Computer Science 2018-02-27 Ilya Soloveychik , Yu Xiang , Vahid Tarokh

An $n \times n$ matrix with $\pm 1$ entries which acts on $\mathbb{R}^n$ as a scaled isometry is called Hadamard. Such matrices exist in some, but not all dimensions. Combining number-theoretic and probabilistic tools we construct matrices…

Probability · Mathematics 2023-03-10 Xiaoyu Dong , Mark Rudelson

We study a class of random matrices that appear in several communication and signal processing applications, and whose asymptotic eigenvalue distribution is closely related to the reconstruction error of an irregularly sampled bandlimited…

Information Theory · Computer Science 2008-06-24 Alessandro Nordio , Carla-Fabiana Chiasserini , Emanuele Viterbo

Tremendous efforts have been made to study the theoretical and algorithmic aspects of sparse recovery and low-rank matrix recovery. This paper fills a theoretical gap in matrix recovery: the optimal sample complexity for stable recovery…

Information Theory · Computer Science 2017-12-27 Yanjun Li , Kiryung Lee , Yoram Bresler

Tremendous efforts have been made to study the theoretical and algorithmic aspects of sparse recovery and low-rank matrix recovery. This paper fills a theoretical gap in matrix recovery: the optimal sample complexity for stable recovery…

Information Theory · Computer Science 2018-01-03 Yanjun Li , Kiryung Lee , Yoram Bresler

We consider the eigenvalue problem for the Reissner-Mindlin system arising in the study of the free vibration modes of an elastic clamped plate. We provide quantitative estimates for the variation of the eigenvalues upon variation of the…

Spectral Theory · Mathematics 2015-01-21 Davide Buoso , Pier Domenico Lamberti

The eigenproblem of low-rank updated matrices are of crucial importance in many applications. Recently, an upper bound on the number of distinct eigenvalues of a perturbed matrix was established. The result can be applied to estimate the…

Numerical Analysis · Mathematics 2017-08-14 Yunjie Wang , Gang Wu

This paper studies the problem of reconstructing binary matrices that are only accessible through few evaluations of their discrete X-rays. Such question is prominently motivated by the demand in material science for developing a tool for…

Combinatorics · Mathematics 2007-05-23 Alberto Del Lungo , Andrea Frosini , Maurice Nivat , Laurent Vuillon

We characterize the existence of a polynomial (rational) matrix when its eigenstructure (complete structural data) and some of its rows are prescribed. For polynomial matrices, this problem was solved in a previous work when the polynomial…

Spectral Theory · Mathematics 2025-04-15 Agurtzane Amparan , Itziar Baragaña , Silvia Marcaida , Alicia Roca

We derive bounds relating Renegar's condition number to quantities that govern the statistical performance of convex regularization in settings that include the $\ell_1$-analysis setting. Using results from conic integral geometry, we show…

Numerical Analysis · Mathematics 2019-09-30 Dennis Amelunxen , Martin Lotz , Jake Walvin

This paper considers theoretical analysis of recovering a low rank matrix given a few expansion coefficients with respect to any basis. The current approach generalizes the existing analysis for the low-rank matrix completion problem with…

Information Theory · Computer Science 2018-12-17 Abiy Tasissa , Rongjie Lai

We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdos-Renyi graph model $G(N,p)$. We prove a local law for the eigenvalue density…

Probability · Mathematics 2016-06-03 Ji Oon Lee , Kevin Schnelli

We numerically analyze the random matrix ensembles of real-symmetric matrices with column/row constraints for many system conditions e.g. disorder type, matrix-size and basis-connectivity. The results reveal a rich behavior hidden beneath…

Statistical Mechanics · Physics 2015-10-28 Suchetana Sadhukhan , Pragya Shukla

This paper is to investigate the spectral properties of sample covariance matrices under a more general population. We consider a class of matrices of the form $\mathbf S_n=\frac1n\mathbf B_n\mathbf X_n\mathbf X_n^*\mathbf B_n^*$, where…

Probability · Mathematics 2018-01-11 Yanqing Yin

We consider a special type of Restricted Boltzmann machine (RBM), namely a Gaussian-spherical RBM where the visible units have Gaussian priors while the vector of hidden variables is constrained to stay on an ${\mathbbm L}_2$ sphere. The…

Disordered Systems and Neural Networks · Physics 2023-07-17 Aurélien Decelle , Cyril Furtlehner

Let $M_n$ be a class of symmetric sparse random matrices, with independent entries $M_{ij} = \delta_{ij} \xi_{ij}$ for $i \leq j$. $\delta_{ij}$ are i.i.d. Bernoulli random variables taking the value $1$ with probability $p \geq…

Probability · Mathematics 2018-02-20 Kyle Luh , Van Vu

We say that a list of real numbers is "symmetrically realisable" if it is the spectrum of some (entrywise) nonnegative symmetric matrix. The Symmetric Nonnegative Inverse Eigenvalue Problem (SNIEP) is the problem of characterising all…

Spectral Theory · Mathematics 2015-01-27 Richard Ellard , Helena Šmigoc

Let A be an n*n random matrix with mean zero and independent inhomogeneous non-constant subgaussian entries. We get that for any k<c\sqrt{n}, the probability of the matrix has a lower rank than n-k that is sub-exponential. Furthermore, we…

Probability · Mathematics 2025-01-28 Guozheng Dai , Zeyan Song , Hanchao Wang