Cover Image

The Empirical Spectral Distribution of i.i.d. Random Matrices with Random Perturbations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Kun, Zhang, Zhihua
Format:	Preprint
Published:	2024
Subjects:	Information Theory Data Structures and Algorithms Numerical Analysis Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions
by: Lai, Peiyao, et al.
Published: (2024)

Probability Tools for Sequential Random Projection
by: Li, Yingru
Published: (2024)

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, $MAM^*$!
by: Boahen, Edem, et al.
Published: (2025)

A Survey of Quantum Alternatives to Randomized Algorithms: Monte Carlo Integration and Beyond
by: Intallura, Philip, et al.
Published: (2023)

Perturbation Bounds for Low-Rank Inverse Approximations under Noise
by: Tran, Phuc, et al.
Published: (2025)

Analysis of Langevin midpoint methods using an anticipative Girsanov theorem
by: Zhang, Matthew S.
Published: (2025)

Extended Fourier analysis of signals
by: Liepins, Vilnis
Published: (2013)

Algorithmic warm starts for Hamiltonian Monte Carlo
by: Zhang, Matthew S., et al.
Published: (2026)

Shifted Composition IV: Toward Ballistic Acceleration for Log-Concave Sampling
by: Altschuler, Jason M., et al.
Published: (2025)

Shifted Composition III: Local Error Framework for KL Divergence
by: Altschuler, Jason M., et al.
Published: (2024)

Lower bounds for trace estimation via Block Krylov and other methods
by: Yu, Shi Jie
Published: (2025)

Random Subgraph Detection Using Queries
by: Huleihel, Wasim, et al.
Published: (2021)

Random Matrices, Intrinsic Freeness, and Sharp Non-Asymptotic Inequalities
by: Bandeira, Afonso S.
Published: (2025)

The Power of Two Matrices in Spectral Algorithms for Community Recovery
by: Dhara, Souvik, et al.
Published: (2022)

Accurate Analysis of Sparse Random Projections
by: Skórski, Maciej
Published: (2024)

A Distribution Testing Approach to Clustering Distributions
by: Kumar, Gunjan, et al.
Published: (2025)

Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy
by: Tran, Phuc, et al.
Published: (2025)

Asymptotically Optimal Sequential Testing with Heterogeneous LLMs
by: Li, Guokai, et al.
Published: (2026)

Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation
by: Gupta, Shivam, et al.
Published: (2023)

Distribution Learnability and Robustness
by: Ben-David, Shai, et al.
Published: (2024)

Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs
by: Jaquard, Hugo, et al.
Published: (2024)

An Instance-Based Approach to the Trace Reconstruction Problem
by: Mazooji, Kayvon, et al.
Published: (2024)

Graph Reconstruction from Noisy Random Subgraphs
by: McGregor, Andrew, et al.
Published: (2024)

Achievability of Heterogeneous Hypergraph Recovery from its Graph Projection
by: Morgan, Alexander, et al.
Published: (2026)

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
by: Gupta, Shivam, et al.
Published: (2024)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
by: Lovig, Maxwell, et al.
Published: (2024)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
by: Chen, Tyler, et al.
Published: (2022)

The ESPRIT algorithm under high noise: Optimal error scaling and noisy super-resolution
by: Ding, Zhiyan, et al.
Published: (2024)

Satisfying the Restricted Isometry Property with the Optimal Number of Rows and Slightly Less Randomness
by: Rao, Shravas
Published: (2023)

Sparse Linear Regression is Easy on Random Supports
by: Chandrasekaran, Gautam, et al.
Published: (2025)

Low-degree Security of the Planted Random Subgraph Problem
by: Bogdanov, Andrej, et al.
Published: (2024)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
by: Musco, Cameron, et al.
Published: (2024)

Sublinear Time Low-Rank Approximation of Hankel Matrices
by: Kapralov, Michael, et al.
Published: (2025)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
by: Matsumoto, Namiko, et al.
Published: (2025)

Planted Bipartite Graph Detection
by: Rotenberg, Asaf, et al.
Published: (2023)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
by: Diakonikolas, Ilias, et al.
Published: (2025)

On the Statistical Complexity of Sample Amplification
by: Axelrod, Brian, et al.
Published: (2022)

Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery
by: Ameen, Taha, et al.
Published: (2024)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)