11 citations · 11 across the 2 of their papers we have counts for
3 papers
math.PR2011★ 11 cited
Competing first passage percolation on random regular graphs
Tonći Antunović, Yael Dekel, Elchanan Mossel +1
We consider two competing first passage percolation processes started from uniformly chosen subsets of a random regular graph on vertices. The processes are allowed to spread w…
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…