6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.LG2022
Weisfeiler-Lehman meets Gromov-Wasserstein
Samantha Chen, Sunhyuk Lim, Facundo Mémoli +2
The Weisfeiler-Lehman (WL) test is a classical procedure for graph isomorphism testing. The WL test has also been widely used both for designing graph kernels and for analyzing gra…
cs.CG2021★ 6 cited
Approximation algorithms for 1-Wasserstein distance between persistence diagrams
Samantha Chen, Yusu Wang
Recent years have witnessed a tremendous growth using topological summaries, especially the persistence diagrams (encoding the so-called persistent homology) for analyzing complex…