38 citations · 248 across the 24 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.ST2021★ 17 cited
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…
math.ST2021★ 3 cited
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…
math.ST2021★ 5 cited
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…