11 citations · 12 across the 3 of their papers we have counts for
3 papers
cs.DS2025
The Planted Spanning Tree Problem
Mehrdad Moharrami, Cristopher Moore, Jiaming Xu
We study the problem of detecting and recovering a planted spanning tree hidden within a complete, randomly weighted graph . Specifically, each edge has a non-nega…
cs.DS2019★ 1 cited
The Planted Matching Problem: Phase Transitions and Exact Results
Mehrdad Moharrami, Cristopher Moore, Jiaming Xu
We study the problem of recovering a planted matching in randomly weighted complete bipartite graphs . For some unknown perfect matching , the weight of an edge is dr…
math.ST2016★ 11 cited
Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization
Jess Banks, Cristopher Moore, Nicolas Verzelen +2
We study the problem of detecting a structured, low-rank signal matrix corrupted with additive Gaussian noise. This includes clustering in a Gaussian mixture model, sparse PCA, and…