Cover Image

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Shujing, Kunisky, Dmitriy
Format:	Preprint
Published:	2025
Subjects:	Probability Data Structures and Algorithms Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
by: Kunisky, Dmitriy
Published: (2024)

Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
by: Kunisky, Dmitriy
Published: (2024)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
by: Ma, Yuxin, et al.
Published: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
by: De, Debsurya, et al.
Published: (2025)

Universality of first-order methods on random and deterministic matrices
by: Gorini, Nicola, et al.
Published: (2026)

Fitting an ellipsoid to random points: predictions using the replica method
by: Maillard, Antoine, et al.
Published: (2023)

Inference of rankings planted in random tournaments
by: Kunisky, Dmitriy, et al.
Published: (2024)

Tensor cumulants for statistical inference on invariant distributions
by: Kunisky, Dmitriy, et al.
Published: (2024)

Statistical inference of a ranked community in a directed graph
by: Kunisky, Dmitriy, et al.
Published: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
by: Kunisky, Dmitriy, et al.
Published: (2023)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
by: Kunisky, Dmitriy, et al.
Published: (2024)

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
by: Chen, Zongchen, et al.
Published: (2024)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
by: Chen, Guanyi, et al.
Published: (2025)

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

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

Finding planted cliques using gradient descent
by: Gheissari, Reza, et al.
Published: (2023)

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

Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
by: Fan, Zhou, et al.
Published: (2026)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2022)

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

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

High-accuracy log-concave sampling with stochastic queries
by: Chen, Fan, et al.
Published: (2026)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
by: Blanca, Antonio, et al.
Published: (2022)

Faster algorithms for the alignment of sparse correlated Erdös-Rényi random graphs
by: Muratori, Andrea, et al.
Published: (2024)

The stochastic block model has the overlap graph property for modularity
by: Bhamidi, Shankar, et al.
Published: (2026)

Perspectives on Stochastic Localization
by: Shi, Bobby, et al.
Published: (2025)

Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
by: R., Abhishek Hegade K., et al.
Published: (2025)

Strong Low Degree Hardness for the Number Partitioning Problem
by: Mallarapu, Rushil, et al.
Published: (2025)

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

Sharp Phase Transitions in Estimation with Low-Degree Polynomials
by: Sohn, Youngtak, et al.
Published: (2025)

Functional Stochastic Localization
by: Gu, Anming, et al.
Published: (2026)

Low-degree estimation thresholds in planted hypergraphs and tensor PCA
by: Fu, Daniel, et al.
Published: (2026)

Adversarially-Robust Inference on Trees via Belief Propagation
by: Hopkins, Samuel B., et al.
Published: (2024)

Learning bounded-degree polytrees with known skeleton
by: Choo, Davin, et al.
Published: (2023)

Learning Mixtures of Gaussians Using Diffusion Models
by: Gatmiry, Khashayar, et al.
Published: (2024)

Online Differentially Private Synthetic Data Generation
by: He, Yiyun, et al.
Published: (2024)

Correlation detection in trees for planted graph alignment
by: Ganassali, Luca, et al.
Published: (2021)

Efficiently matching random inhomogeneous graphs via degree profiles
by: Ding, Jian, et al.
Published: (2023)

Fitting an ellipsoid to a quadratic number of random points
by: Bandeira, Afonso S., et al.
Published: (2023)

Testing Convex Truncation
by: De, Anindya, et al.
Published: (2023)