most citedLatent Space Model for Higher-order Networks and Generalized Tensor Decomposition

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing stat.MLShow all

1 paper · 1 filter

stat.ML2018

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…