• Corpus ID: 252531781

Extreme singular values of inhomogeneous sparse random rectangular matrices

@inproceedings{Dumitriu2022ExtremeSV,
  title={Extreme singular values of inhomogeneous sparse random rectangular matrices},
  author={Ioana Dumitriu and Yizhe Zhu},
  year={2022}
}
. 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 Hermitian matrices with a bipartite block structure. Our main results are probabilistic upper (respectively, lower) bounds for the largest (respectively, smallest) singular values of a large rectangular random matrix X . These bounds are given in terms of the maximal and minimal ℓ 2 -norms… 

Sparse random hypergraphs: Non-backtracking spectra and community detection

  • L. StephanYizhe Zhu
  • Computer Science, Mathematics
    2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • 2022
To the best of the knowledge, this is the first provable and efficient spectral algorithm that achieves the conjectured threshold for HSBMs with r blocks generated according to a general symmetric probability tensor.

References

SHOWING 1-10 OF 67 REFERENCES

Spectral radii of sparse random matrices

The paper establishes bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erdős-Renyi graphs and establishes a crossover in the behaviour of the extreme eigenvalues around $d \sim \log n$.

On the Largest and the Smallest Singular Value of Sparse Rectangular Random Matrices

. We derive estimates for the largest and smallest singular values of sparse rectangular N × n random matrices, assuming lim N,n →∞ nN = y ∈ (0 , 1) . We consider a model with sparsity parameter p N

Universality and sharp matrix concentration inequalities

Abstract. We show that, under mild assumptions, the spectrum of a sum of independent random matrices is close to that of the Gaussian random matrix whose entries have the same mean and covariance.

Matrix Concentration Inequalities and Free Probability

These bounds quantify the degree to which the deterministic matrices Ai behave as though they are freely independent, and imply strong asymptotic freeness for a remarkably general class of Gaussian random matrix models, including matrices that may be very sparse and that lack any special symmetries.

Introduction to the non-asymptotic analysis of random matrices

This is a tutorial on some basic non-asymptotic methods and concepts in random matrix theory, particularly for the problem of estimating covariance matrices in statistics and for validating probabilistic constructions of measurementMatrices in compressed sensing.

Spectral gap in random bipartite biregular graphs and applications

We prove an analogue of Alon’s spectral gap conjecture for random bipartite, biregular graphs. We use the Ihara–Bass formula to connect the non-backtracking spectrum to that of the adjacency

Exact spectral norm error of sample covariance

Gaussian widths over spherical slices of the ellipsoid play the role of a first-order analogue to the zeroth-order characteristic r ( Σ ). an immediate of the first-order the of the In the more special

Sparse random hypergraphs: Non-backtracking spectra and community detection

To the best of the knowledge, this is the first provable and efficient spectral algorithm that achieves the conjectured threshold for HSBMs with r blocks generated according to a general symmetric probability tensor.

Ip-spread and restricted isometry properties of sparse random matrices

The spread properties of the kernels of sparse random matrices are studied, and it is proved that with high probability such subspaces contain vectors x that are o(1) · ||x||2-close to o(n)-sparse with respect to the ℓ2-norm, and in particular are not ™2-spread.

Dimension-free Bounds for Sums of Independent Matrices and Simple Tensors via the Variational Principle

This work considers the deviation inequalities for the sums of independent d by d random matrices, as well as rank one random tensors, and presents the bounds that do not depend explicitly on the dimension d, but rather on the e-ective rank.
...