44 citations · 88 across the 7 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
stat.ML2018★ 3 cited
Consistent polynomial-time unseeded graph matching for Lipschitz graphons
Yuan Zhang
We propose a consistent polynomial-time method for the unseeded node matching problem for networks with smooth underlying structures. Despite widely conjectured by the research com…
stat.ME2018★ 5 cited
Unseeded low-rank graph matching by transform-based unsupervised point registration
Yuan Zhang
The problem of learning a correspondence relationship between nodes of two networks has drawn much attention of the computer science community and recently that of statisticians. T…