47 citations · 51 across the 6 of their papers we have counts for
6 papers
Tensor cumulants for statistical inference on invariant distributions
Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein
Many problems in high-dimensional statistics appear to have a statistical-computational gap: a range of values of the signal-to-noise ratio where inference is information-theoretic…
Low-degree phase transitions for detecting a planted clique in sublinear time
Jay Mardia, Kabir Aladin Verchand, Alexander S. Wein
We consider the problem of detecting a planted clique of size in a random graph on vertices. When the size of the clique exceeds , polynomial-time algorithms f…
Information-Theoretic Thresholds for Planted Dense Cycles
Cheng Mao, Alexander S. Wein, Shenduo Zhang
We study a random graph model for small-world networks which are ubiquitous in social and biological sciences. In this model, a dense cycle of expected bandwidth , representin…
Detection of Dense Subhypergraphs by Low-Degree Polynomials
Abhishek Dhawan, Cheng Mao, Alexander S. Wein
Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem that has been extensively studied in recent years. We study a hypergr…
Is Planted Coloring Easier than Planted Clique?
Pravesh K. Kothari, Santosh S. Vempala, Alexander S. Wein +1
We study the computational complexity of two related problems: recovering a planted -coloring in , and finding efficiently verifiable witnesses of non--colorability…
Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization
Amelia Perry, Alexander S. Wein, Afonso S. Bandeira +1
A central problem of random matrix theory is to understand the eigenvalues of spiked random matrix models, in which a prominent eigenvector is planted into a random matrix. These d…