The Lovász Number of Random Graphs
Combinatorics, Probability and Computing
MAX k-CUT and approximating the chromatic number of random graphs
Random Structures & Algorithms
Strong Refutation Heuristics for Random k-SAT
Combinatorics, Probability and Computing
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
Expansion and Lack Thereof in Randomly Perturbed Graphs
Algorithms and Models for the Web-Graph
Bound for the L2 Norm of Random Matrix and Succinct Matrix Approximation
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part II
Scalable onion routing with torsk
Proceedings of the 16th ACM conference on Computer and communications security
Matrix completion from a few entries
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
Matrix completion from a few entries
IEEE Transactions on Information Theory
Finding Planted Partitions in Random Graphs with General Degree Distributions
SIAM Journal on Discrete Mathematics
Algorithms and hardness for subspace approximation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete 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
An adaptive spectral heuristic for partitioning random graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A fast random sampling algorithm for sparsifying matrices
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
On laplacians of random complexes
Proceedings of the twenty-eighth annual symposium on Computational geometry
Loose laplacian spectra of random hypergraphs
Random Structures & Algorithms
Sparse random graphs: Eigenvalues and eigenvectors
Random Structures & Algorithms
Efficient crowdsourcing for multi-class labeling
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
| Hi-index | 0.06 |
We analyze the eigenvalue gap for the adjacency matrices of sparse random graphs. Let λ1 ≥ … ≥ λn be the eigenvalues of an n-vertex graph, and let λ = max[λ2,|λn|]. Let c be a large enough constant. For graphs of average degree d = c log n it is well known that λ1 ≥ d, and we show that $\lambda = O(\sqrt{d})$. For d = c it is no longer true that $\lambda = O(\sqrt{d})$, but we show that by removing a small number of vertices of highest degree in G, one gets a graph G′ for which $\lambda = O(\sqrt{d})$. Our proofs are based on the techniques of Friedman Kahn and Szemeredi from STOC 1989, who proved similar results for regular graphs. Our results are useful for extending the analysis of certain heuristics to sparser instances of NP-hard problems. We illustrate this by removing some unnecessary logarithmic factors in the density of k-SAT formulas that are refuted by the algorithm of Goerdt and Krivelevich from STACS 2001. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005