38 citations · 248 across the 24 of their papers we have counts for
9 papers · 1 filter
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…
Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model
Zhou Fan, Cheng Mao, Yihong Wu +1
Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally in…
Efficient random graph matching via degree profiles
Jian Ding, Zongming Ma, Yihong Wu +1
Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs a…
Semidefinite Programs for Exact Recovery of a Hidden Community
Bruce Hajek, Yihong Wu, Jiaming Xu
We study a semidefinite programming (SDP) relaxation of the maximum likelihood estimation for exactly recovering a hidden community of cardinality from an symmetri…
Submatrix localization via message passing
Bruce Hajek, Yihong Wu, Jiaming Xu
The principal submatrix localization problem deals with recovering a principal submatrix of elevated mean in a large symmetric matrix subject to additiv…
Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in Time
Bruce Hajek, Yihong Wu, Jiaming Xu
Community detection is considered for a stochastic block model graph of n vertices, with K vertices in the planted community, edge probability p for pairs of vertices both in the c…