Pass efficient algorithms for approximating large matrices
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A decentralized algorithm for spectral analysis
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Machine Learning
Clustering via matrix powering
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tensor decomposition and approximation schemes for constraint satisfaction problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Error bounds for correlation clustering
ICML '05 Proceedings of the 22nd international conference on Machine learning
Finding Large Independent Sets in Polynomial Expected Time
Combinatorics, Probability and Computing
Exploiting asymmetry in hierarchical topic extraction
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Spectral clustering by recursive partitioning
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Spectral clustering with limited independence
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A rigorous analysis of population stratification with limited data
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A decentralized algorithm for spectral analysis
Journal of Computer and System Sciences
A discriminative framework for clustering via similarity functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
ACM SIGACT News
Visual analysis of controversy in user-generated encyclopedias
Information Visualization - Special issue on visual analytics science and technology
How hard is it to approximate the best Nash equilibrium?
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Fitting a graph to vector data
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Group-Level Analysis and Visualization of Social Networks
Algorithmics of Large and Complex Networks
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Random Tensors and Planted Cliques
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Foundations and Trends® in Theoretical Computer Science
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
An efficient and accurate graph-based approach to detect population substructure
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
A spectral method for MAX2SAT in the planted solution model
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Separating populations with wide data: a spectral analysis
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
Correlation clustering with noisy input
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Finding Planted Partitions in Random Graphs with General Degree Distributions
SIAM Journal on Discrete Mathematics
Network ensemble clustering using latent roles
Advances in Data Analysis and Classification
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
Boosting spectral partitioning by sampling and iteration
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The spectral gap of random graphs with given expected degrees
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
An adaptive spectral heuristic for partitioning random graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Coloring random 3-colorable graphs with non-uniform edge probabilities
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Toward privacy in public databases
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Bounding the misclassification error in spectral partitioning in the planted partition model
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Reconstructing many partitions using spectral techniques
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Testability of minimum balanced multiway cut densities
Discrete Applied Mathematics
A simple message passing algorithm for graph partitioning problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Finding overlapping communities in social networks: toward a rigorous approach
Proceedings of the 13th ACM Conference on Electronic Commerce
EgoNav: exploring networks through egocentric spatializations
Proceedings of the International Working Conference on Advanced Visual Interfaces
Computer Science Review
Sorting noisy data with partial information
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Low rank approximation and regression in input sparsity time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Statistical algorithms and a lower bound for detecting planted cliques
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Learning mixtures of arbitrary distributions over large discrete domains
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved if the input data is drawn randomly from a distribution over graphs containing acceptable solutions.In this paper we show that a simple spectral algorithm can solve all three problems above in the average case, as well as a more general problem of partitioning graphs based on edge density. In nearly all cases our approach meets or exceeds previous parameters, while introducing substantial generality. We apply spectral techniques, using foremost the observation that in all of these problems, the expected adjacency matrix is a low rank matrix wherein the structure of the solution is evident.