38 citations · 248 across the 24 of their papers we have counts for
24 papers
High-Dimensional Procrustes Matching via Tree Counts
Xiaochun Niu, Tselil Schramm, Jiaming Xu
Suppose we observe two sets of Gaussian vectors in , with the promise that, after applying a permutation of and a rotation of , the two sets a…
Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the Regime
Hang Du, Cheng Mao, Nike Sun +2
A random geometric graph (RGG) is generated by first sampling latent points independently and uniformly from the unit sphere in , and then connecting…
Optimality of Random Regular Graphs in Sparse Network Designs
Weijia Li, Xiaochun Niu, Yehua Wei +1
The problems of designing sparse networks arise frequently in resource allocation and operations research. In production systems, for example, sparse process flexibility designs ar…
Random geometric graphs with smooth kernels: sharp detection threshold and a spectral conjecture
Cheng Mao, Yihong Wu, Jiaming Xu
A random geometric graph (RGG) with kernel is constructed by first sampling latent points independently and uniformly from the -dimensional unit sphere, the…
The broken sample problem revisited: Proof of a conjecture by Bai-Hsing and high-dimensional extensions
Simiao Jiao, Yihong Wu, Jiaming Xu
We revisit the classical broken sample problem: Two samples of i.i.d.\ data points and are observed w…
Sharp Information-Theoretic Thresholds for Shuffled Linear Regression
Leon Lufkin, Yihong Wu, Jiaming Xu
This paper studies the problem of shuffled linear regression, where the correspondence between predictors and responses in a linear model is obfuscated by a latent permutation. Spe…