On the second eigenvalue of random regular graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
A Spectral Technique for Coloring Random 3-Colorable Graphs
SIAM Journal on Computing
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Analysis of gene expression profiles: class discovery and leaf ordering
Proceedings of the sixth annual international conference on Computational biology
Spectral Techniques in Graph Algorithms
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Spectral Partitioning of Random Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The Largest Eigenvalue of Sparse Random Graphs
Combinatorics, Probability and Computing
Spectral Analysis of Random Graphs with Skewed Degree Distributions
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Spectral techniques applied to sparse random graphs
Random Structures & Algorithms
Spectral clustering by recursive partitioning
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the Laplacian Eigenvalues of Gn,p
Combinatorics, Probability and Computing
Eigenvalues and graph bisection: An average-case analysis
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A spectral technique for random satisfiable 3CNF formulas
Random Structures & Algorithms
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
Reconstructing many partitions using spectral techniques
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We consider the problem of recovering a planted partition such as a coloring, a small bisection, or a large cut in an (apart from that) random graph. In the last 30 years many algorithms for this problem have been developed that work provably well on various random graph models resembling the Erdős-Rényi model $G_{n,m}$. In these random graph models edges are distributed uniformly, and thus the degree distribution is very regular. By contrast, the recent theory of large networks shows that real-world networks frequently have a significantly different distribution of the edges and hence also a different degree distribution. Therefore, a variety of new types of random graphs have been introduced to capture these specific properties. One of the most popular models is characterized by a prescribed expected degree sequence. We study a natural variant of this model that features a planted partition. Our main result is that there is a polynomial time algorithm for recovering (a large part of) the planted partition in this model even in the sparse case, where the average degree is constant. In contrast to prior work, the input of the algorithm consists only of the graph, i.e., no further parameters of the model (such as the expected degree sequence) are revealed to the algorithm.