Extreme singular values of inhomogeneous sparse random rectangular matrices

DOI10.3150/23-BEJ1699MaRDI QIDQ6589578zbMATH OpenFDO

Authors Ioana Dumitriu, Yizhe Zhu

Publication date 20 August 2024

Published in Bernoulli (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3150/23-BEJ1699

zbMATH Keywords

extreme singular valueinhomogeneous random matrixnon-backtracking operatorrandom bipartite graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20)

Recommendations

• On the largest and the smallest singular value of sparse rectangular random matrices
• Spectral radii of sparse random matrices
• Smallest singular value of sparse random matrices
• Universality of the least singular value for sparse random matrices
• On the singular values of random matrices

Cites work

• _p-spread and restricted isometry properties of sparse random matrices
• A graphon approach to limiting spectral distributions of Wigner-type matrices
• A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
• A universality result for the smallest eigenvalues of certain sample covariance matrices
• Almost sure convergence of the largest and smallest eigenvalues of high-dimensional sample correlation matrices
• An introduction to matrix concentration inequalities
• Analysis of spectral clustering algorithms for community detection: the general bipartite setting
• Bounding the smallest singular value of a random matrix without concentration
• Concentration and regularization of random graphs
• Concentration inequalities. A nonasymptotic theory of independence
• Detection thresholds in very sparse matrix completion
• Dimension-free bounds for sums of independent matrices and simple tensors via the variational principle
• Eigenvalues of the non-backtracking operator detached from the bulk
• Extremal eigenvalues of critical Erdős-Rényi graphs
• Extreme eigenvalues of sparse, heavy tailed random matrices
• High-dimensional probability. An introduction with applications in data science
• scientific article; zbMATH DE number 1495995 (Why is no real title available?)
• Invertibility of sparse non-Hermitian matrices
• Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
• Limit of the smallest eigenvalue of a large dimensional sample covariance matrix
• Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph
• Lower bounds for the smallest singular value of structured random matrices
• Matrix concentration inequalities and free probability
• Non-asymptotic theory of random matrices: extreme singular values
• Non-backtracking spectra of weighted inhomogeneous random graphs
• Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
• On Tanner codes: Minimum distance and decoding
• On the convergence of the extremal eigenvalues of empirical covariance matrices with dependence
• On the interval of fluctuation of the singular values of random matrices
• On the largest and the smallest singular value of sparse rectangular random matrices
• On the non-asymptotic concentration of heteroskedastic Wishart-type matrix
• On the second eigenvalue of random bipartite biregular graphs
• On the spectral norm of Gaussian random matrices
• Outliers in spectrum of sparse Wigner matrices
• Random polytopes obtained by matrices with heavy-tailed entries
• Sample Covariance Matrices of Heavy-Tailed Distributions
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
• Smallest singular value of a random rectangular matrix
• Smallest singular value of sparse random matrices
• Some inequalities for Gaussian processes and applications
• Spectra of random regular hypergraphs
• Spectral analysis of large dimensional random matrices
• Spectral condition-number estimation of large sparse matrices.
• Spectral gap in random bipartite biregular graphs and applications
• Spectral radii of sparse random matrices
• The dimension-free structure of nonhomogeneous random matrices
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• The Largest Eigenvalue of Sparse Random Graphs
• The limit of the smallest singular value of random matrices with i.i.d. entries
• The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
• The smallest singular value of inhomogeneous square random matrices
• The smallest singular value of random rectangular matrices with no moment assumptions on entries
• The threshold for SDP-refutation of random regular NAE-3SAT
• Universality of the least singular value for sparse random matrices

Cited in

(3)

• Universality and sharp matrix concentration inequalities
• Stochastic rounding implicitly regularizes tall-and-thin matrices
• Comparison theorems for the minimum eigenvalue of a random positive-semidefinite matrix

This page was built for publication: Extreme singular values of inhomogeneous sparse random rectangular matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589578)