D
Dan Vilenchik
Researcher at Ben-Gurion University of the Negev
Publications - 70
Citations - 880
Dan Vilenchik is an academic researcher from Ben-Gurion University of the Negev. The author has contributed to research in topics: Random graph & Computer science. The author has an hindex of 17, co-authored 62 publications receiving 794 citations. Previous affiliations of Dan Vilenchik include Tel Aviv University & University of California, Berkeley.
Papers
More filters
Journal ArticleDOI
Do semidefinite relaxations solve sparse PCA up to the information limit
TL;DR: It is proved that when the proposed SDP approach, at least in its standard usage, cannot recover the sparse spike, and empirical results suggesting that up to sparsity levels $k=O(\sqrt{n})$, recovery is possible by a simple covariance thresholding algorithm.
Journal ArticleDOI
The condensation phase transition in random graph coloring
TL;DR: In this paper, the authors prove the existence of condensation phase transition in random graph coloring problems, and prove the location of the condensation in terms of a distributional fixed point problem.
Proceedings ArticleDOI
Solving random satisfiable 3CNF formulas in expected polynomial time
TL;DR: It is proved that for some natural distribution on 3CNF formulas, called planted 3SAT, the algorithm presented has expected polynomial running time and extends to k-SAT for any constant k.
Journal ArticleDOI
Do semidefinite relaxations solve sparse pca up to the information limit
TL;DR: For a single-spike model with an ε-sparse eigenvector, in the asymptotic regime as dimension $p$ and sample size $n$ both tend to infinity.
Journal ArticleDOI
The Condensation Phase Transition in Random Graph Coloring
TL;DR: This paper proves the conjecture that in addition to the k-colorability phase transition studied intensively in combinatorics, there exists a second phase transition called the condensation phase transition, which is located in terms of a certain distributional fixed point problem.