scientific article; zbMATH DE number 7370536
From MaRDI portal
Publication:4998890
Hemant Tyagi, Mihai Cucuringu, Alexandre d'Aspremont
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1906.02746
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
rankingsingular value decompositionrandom matrix theoryspectral algorithmslow-rank matrix completionangular synchronizationmatrix perturbation theory
Related Items (3)
An extension of the angular synchronization problem to the heterogeneous setting ⋮ Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods ⋮ Lead-lag detection and network clustering for multivariate time series with an application to the us equity market
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Impact of regularization on spectral clustering
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
- Angular synchronization by eigenvectors and semidefinite programming
- Statistical ranking and combinatorial Hodge theory
- Modeling outcomes of soccer matches
- Templates for convex cone problems with applications to sparse signal recovery
- Deformed Laplacians and spectral ranking in directed networks
- Exact matrix completion via convex optimization
- Eigenvector synchronization, graph rigidity and the molecule problem
- Vector diffusion maps and the connection Laplacian
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On Perturbations of Matrix Pencils with Real Spectra
- Synchronization over Cartan Motion Groups via Contraction
- A survey of structure from motion.
- Why Are Big Data Matrices Approximately Low Rank?
- 1-Bit matrix completion
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Concentration and regularization of random graphs
- Low-rank matrix completion using alternating minimization
- Perturbation bounds in connection with singular value decomposition
- Rank Centrality: Ranking from Pairwise Comparisons
- Phase Retrieval via Matrix Completion
This page was built for publication:
