2 papers
math.CO2010
Finding Hidden Cliques in Linear Time with High Probability
Yael Dekel, Ori Gurel-Gurevich, Yuval Peres
We are given a graph with vertices, where a random subset of vertices has been made into a clique, and the remaining edges are chosen independently with probability $\t…
math.PR2008
Eigenvectors of random graphs: Nodal domains
Yael Dekel, James R. Lee, Nathan Linial
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relative…