Spectral partitioning of random graphs

Similar Works

Action	Title	Year	Authors
+	An Adaptive Spectral Heuristic for Partitioning Random Graphs	2006	Amin Coja‐Oghlan
+ PDF Chat	Graph Partitioning via Adaptive Spectral Techniques	2009	Amin Coja‐Oghlan
+	Spectral Partitioning of Random Graphs with Given Expected Degrees	2006	Amin Coja‐Oghlan Andreas Goerdt André Lanka
+	Spectral partitioning of random graphs with given expected degrees	2006	Andreas Goerdt Amin Coja‐Oghlan André Lanka
+	Graph partitioning via adaptive spectral techniques.	2006	Amin Coja‐Oghlan
+	SPECTRAL TECHNIQUES FOR PARTITIONING PLANTED RANDOM GRAPHS	2013	Yufei Zhao
+	Spectral Partitioning of Random Graphs with Given Expected Degrees - Detailed Version	2009	Amin Coja‐Oghlan Andreas Goerdt André Lanka
+	An Iterative Spectral Approach to Recovering Planted Partitions	2018	Samuel Cole
+	Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model	2018	Debarghya Ghoshdastidar
+	Sampling Based Efficient Algorithm to Estimate the Spectral Radius of Large Graphs	2017	Samar Abbas Juvaria Tariq Arif Zaman Imdadullah Khan
+	Phase Transitions in Spectral Community Detection	2014	Pin‐Yu Chen Alfred O. Hero
+ PDF Chat	Phase Transitions in Spectral Community Detection	2015	Pin‐Yu Chen Alfred O. Hero
+	A randomized algorithm for spectral clustering	2010	Nicola Rebagliati Alessandro Verri
+	Robust and efficient multi-way spectral clustering	2016	Anil Damle Victor Minden Lexing Ying
+	Spectral concentration and greedy k-clustering	2018	Tamal K. Dey Pan Peng Alfred Rossi Anastasios Sidiropoulos
+	Clustering Without an Eigengap	2023	Matthew Zurek Yudong Chen
+	Clustering algorithms for random and pseudo-random structures	2008	Ravindran Kannan Pradipta Mitra
+	Spectral concentration and greedy k-clustering	2014	Tamal K. Dey Pan Peng Alfred Rossi Anastasios Sidiropoulos
+	Spectral concentration and greedy k-clustering	2014	Tamal K. Dey Pan Peng Alfred Rossi Anastasios Sidiropoulos
+ PDF Chat	Simple, direct and efficient multi-way spectral clustering	2018	Anil Damle Victor Minden Lexing Ying

Works That Cite This (455)

Action	Title	Year	Authors
+	A Simple Spectral Algorithm for Recovering Planted Partitions	2015	Sam Cole Shmuel Friedland Lev Reyzin
+	Information Limits for Recovering a Hidden Community	2017	Bruce Hajek Yihong Wu Jiaming Xu
+	On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors	2016	Andrea Montanari Daniel Reichman Ofer Zeitouni
+	Contiguity and non-reconstruction results for planted partition models: the dense case	2018	Debapratim Banerjee
+	Recovering the structure of random linear graphs	2018	Israel Rocha Jeannette Janssen Nauzer Kalyaniwalla
+	Nonconvex Optimization Methods: Iteration Complexity And Applications	2020	Junyu Zhang
+ PDF Chat	Reconstruction and estimation in the planted partition model	2014	Elchanan Mossel Joseph Neeman Allan Sly
+ PDF Chat	Concentration and regularization of random graphs	2017	Can M. Le Elizaveta Levina Roman Vershynin
+	Random perturbation of low rank matrices: Improving classical bounds	2017	Sean O’Rourke Van Vu Ke Wang
+	Eigenvectors of random matrices: A survey	2016	Sean O’Rourke Van Vu Ke Wang

Works Cited by This (12)

Action	Title	Year	Authors
+	Heuristics for finding large independent sets, with applications to coloring semi-random graphs	2002	Uriel Feige Joe Kilian
+	The Rotation of Eigenvectors by a Perturbation. III	1970	Chandler Davis W. Kahan
+	Algorithms for graph partitioning on the planted partition model	2001	Anne Condon Richard M. Karp
+ PDF Chat	On the concentration of eigenvalues of random symmetric matrices	2002	Noga Alon Michael Krivelevich Van H. Vu
+	Spectral partitioning works: planar graphs and finite element meshes	1996	Daniel A. Spielman Shang‐Hua Teng
+	A Spectral Technique for Coloring Random 3-Colorable Graphs	1997	Noga Alon Nabil Kahalé
+	Fast computation of low rank matrix approximations	2001	Dimitris Achlioptas Frank McSherry
+	The eigenvalues of random symmetric matrices	1981	Zoltán Füredi János Komlós
+	Coloring Random and Semi-Random k-Colorable Graphs	1995	Avrim Blum J. Spencer
+	Simulated annealing for graph bisection	2002	Mark Jerrum Gregory B. Sorkin