38 citations · 248 across the 24 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
stat.ML2018★ 21 cited
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…
math.ST2018★ 3 cited
Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits
Yihong Wu, Jiaming Xu
Over the past few years, insights from computer science, statistical physics, and information theory have revealed phase transitions in a wide array of high-dimensional statistical…
cs.DM2018★ 2 cited
Hidden Hamiltonian Cycle Recovery via Linear Programming
Vivek Bagaria, Jian Ding, David Tse +2
We introduce the problem of hidden Hamiltonian cycle recovery, where there is an unknown Hamiltonian cycle in an -vertex complete graph that needs to be inferred from noisy edge…