38 citations · 248 across the 24 of their papers we have counts for
9 papers · 1 filter
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…
Random Graph Matching in Geometric Models: the Case of Complete Graphs
Haoyu Wang, Yihong Wu, Jiaming Xu +1
This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching…
Testing network correlation efficiently via counting trees
Cheng Mao, Yihong Wu, Jiaming Xu +1
We propose a new procedure for testing whether two networks are edge-correlated through some latent vertex correspondence. The test statistic is based on counting the co-occurrence…
The planted matching problem: Sharp threshold and infinite-order phase transition
Jian Ding, Yihong Wu, Jiaming Xu +1
We study the problem of reconstructing a perfect matching hidden in a randomly weighted bipartite graph. The edge set includes every node pair in and each o…
Settling the Sharp Reconstruction Thresholds of Random Graph Matching
Yihong Wu, Jiaming Xu, Sophie H. Yu
This paper studies the problem of recovering the hidden vertex correspondence between two edge-correlated random graphs. We focus on the Gaussian model where the two graphs are com…