Graph partitioning via adaptive spectral techniques
From MaRDI portal
Publication:3557535
DOI10.1017/S0963548309990514zbMATH Open1209.05178OpenAlexW2133361319MaRDI QIDQ3557535FDOQ3557535
Authors: Amin Coja-Oghlan 
Publication date: 23 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548309990514
Recommendations
Cites Work
- The eigenvalues of random symmetric matrices
- Title not available (Why is that?)
- The Metropolis algorithm for graph bisection
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- On clusterings: good, bad and spectral
- A Spectral Technique for Coloring Random 3-Colorable Graphs
- The Largest Eigenvalue of Sparse Random Graphs
- The solution of some random NP-hard problems in polynomial expected time
- Quick approximation to matrices and applications
- Spectral techniques applied to sparse random graphs
- Sparse quasi-random graphs
- Heuristics for semirandom graph problems
- General paritioning on random graphs
- Max Cut for Random Graphs with a Planted Partition
Cited In (35)
- Constructing uniquely realizable graphs
- Contiguity and non-reconstruction results for planted partition models: the dense case
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Asymptotic mutual information for the balanced binary stochastic block model
- Recovering nonuniform planted partitions via iterated projection
- Community detection and stochastic block models: recent developments
- An Adaptive Spectral Heuristic for Partitioning Random Graphs
- Adaptive aggregation on graphs
- Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown
- Step-by-step community detection in volume-regular graphs
- Consistency of spectral clustering in stochastic block models
- Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator
- Learning sparse graphons and the generalized Kesten-Stigum threshold
- Spectral redemption in clustering sparse networks
- Title not available (Why is that?)
- Strong consistency, graph Laplacians, and the stochastic block model
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Network representation using graph root distributions
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
- Weighted message passing and minimum energy flow for heterogeneous stochastic block models with side information
- A Simple SVD Algorithm for Finding Hidden Partitions
- On the hardness of designing public signals
- Optimality of spectral clustering in the Gaussian mixture model
- Find Your Place: Simple Distributed Algorithms for Community Detection
- A simple spectral algorithm for recovering planted partitions
- Graph powering and spectral robustness
- An adaptive algorithm for vector partitioning
- Signed graph partitioning by spectral rounding
- Sparse general Wigner-type matrices: local law and eigenvector delocalization
- Reconstruction and estimation in the planted partition model
- Title not available (Why is that?)
- Combinatorial statistics and the sciences
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting
- Community detection in sparse networks via Grothendieck's inequality
- Finding one community in a sparse graph
This page was built for publication: Graph partitioning via adaptive spectral techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557535)
