Spectral techniques applied to sparse random graphs
From MaRDI portal
Publication:5318249
Recommendations
Cites work
- scientific article; zbMATH DE number 1689045 (Why is no real title available?)
- scientific article; zbMATH DE number 2038711 (Why is no real title available?)
- scientific article; zbMATH DE number 2079359 (Why is no real title available?)
- Certifying unsatisfiability of random \(2k\)-SAT formulas using approximation techniques.
- Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
- Relations between average case complexity and approximation complexity
Cited in
(81)- Finding one community in a sparse graph
- Detecting structured signals in Ising models
- The spectral gap of sparse random digraphs
- A Global synchronization theorem for oscillators on a random graph
- On an anti-Ramsey threshold for random graphs
- Spectral Compressed Sensing via Projected Gradient Descent
- scientific article; zbMATH DE number 7049740 (Why is no real title available?)
- Mean-Field Approximations for Stochastic Population Processes with Heterogeneous Interactions
- On the Laplacian Eigenvalues of Gn,p
- Sherali-adams strikes back
- Community detection and stochastic block models: recent developments
- Why almost all \(k\)-colorable graphs are easy to color
- Spectral statistics of sparse Erdős-Rényi graph Laplacians
- On semidefinite relaxations for the block model
- Spectral radii of sparse random matrices
- The skew spectral radius and skew Randić spectral radius of general random oriented graphs
- Expansion and Lack Thereof in Randomly Perturbed Graphs
- Empirical spectral distributions of sparse random graphs
- Optimal and algorithmic norm regularization of random matrices
- Consistency of spectral clustering in stochastic block models
- The Hopfield model on a sparse Erdös-Renyi graph
- Swarming on random graphs. II
- Simplex links in determinantal hypertrees
- Algebraic and combinatorial expansion in random simplicial complexes
- Spectral norm bounds for block Markov chain random matrices
- Graph partitioning via adaptive spectral techniques
- Efficient Simulation of Sparse Graphs of Point Processes
- A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization
- scientific article; zbMATH DE number 1189239 (Why is no real title available?)
- Second largest eigenpair statistics for sparse graphs
- Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
- Strong consistency guarantees for clustering high-dimensional bipartite graphs with the spectral method
- Simplicial Kirchhoff index of random complexes
- Analysis of crowdsourced sampling strategies for HodgeRank with sparse random graphs
- The theta number of simplicial complexes
- Clustering in block Markov chains
- Sparse regular random graphs: spectral density and eigenvectors
- Convex relaxation methods for community detection
- Spectral edge in sparse random graphs: upper and lower tail large deviations
- Vertices cannot be hidden from quantum spatial search for almost all random graphs
- Universality of the mean-field for the Potts model
- Strong consistency, graph Laplacians, and the stochastic block model
- Extremal eigenvalues of critical Erdős-Rényi graphs
- Probability of graphs with large spectral gap by multicanonical Monte Carlo
- Distributed user profiling via spectral methods
- Sampling based succinct matrix approximation
- Sparse random tensors: concentration, regularization and applications
- On the efficacy of higher-order spectral clustering under weighted stochastic block models
- The spectral gap of a random subgraph of a graph
- Outliers in spectrum of sparse Wigner matrices
- On the spectrum of dense random geometric graphs
- On the second eigenvalue of random bipartite biregular graphs
- A Simple SVD Algorithm for Finding Hidden Partitions
- The spectra of random mixed graphs
- On the spectra of general random mixed graphs
- Sparse topologies with small spectrum size
- Sparse random graphs: eigenvalues and eigenvectors
- Recovering structured probability matrices
- Spectral algorithms for unique games
- Role of normalization in spectral clustering for stochastic blockmodels
- Constructive regularization of the random matrix norm
- Loose Laplacian spectra of random hypergraphs
- Recognizing more random unsatisfiable 3-SAT instances efficiently
- Large Rainbow Cliques in Randomly Perturbed Dense Graphs
- Functional limit theorems for random regular graphs
- Spectral clustering in the dynamic stochastic block model
- Non-backtracking spectra of weighted inhomogeneous random graphs
- Message passing algorithms for MLS-3LIN problem
- Spectra of edge-independent random graphs
- Size biased couplings and the spectral gap for random regular graphs
- Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models
- Detection thresholds in very sparse matrix completion
- Faster least squares approximation
- Norms of random matrices: local and global problems
- Fluctuations in mean-field Ising models
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
- Capacity of an associative memory model on random graph architectures
- Community detection in sparse networks via Grothendieck's inequality
- An \({\ell_p}\) theory of PCA and spectral clustering
- Sherali-Adams strikes back
This page was built for publication: Spectral techniques applied to sparse random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5318249)
