Switching graph matrix norm bounds: from i.i.d. To random regular graphs
From MaRDI portal
Cites work
- A nearly tight sum-of-squares lower bound for the planted clique problem
- A proof of alon's second eigenvalue conjecture
- Computational barriers to estimation from low-degree polynomials
- Ellipsoid fitting up to a constant
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 7788416 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
- Mixture models, robustness, and sum of squares proofs
- Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs
- ON EIGENVALUES AND COLORINGS OF GRAPHS, II
- Polynomial-time tensor decompositions with sum-of-squares
- Robust moment estimation and improved clustering via sum of squares
- SOS lower bound for exact planted clique
- Sparse random graphs: eigenvalues and eigenvectors
- Spectral methods from tensor networks
- Strongly refuting random CSPs below the spectral threshold
- Sum-of-squares lower bounds for densest k-subgraph
- Sum-of-squares lower bounds for sparse independent set
- The Lovász theta function for random regular graphs and community detection in the hard regime
- The spectral gap of random regular graphs
- The threshold for SDP-refutation of random regular NAE-3SAT
This page was built for publication: Switching graph matrix norm bounds: from i.i.d. To random regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296759)
