Fused Gromov-Wasserstein distances are extended with feature selection via Lasso/Ridge regularization or simplex-constrained weights, yielding theoretical bounds, metric properties, and an alternating minimization algorithm.
Geometry of graph partitions via optimal transport.SIAM Journal on Scientific Computing, 42(5):A3340–A3366
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
Census dual graphs are characterized as nearly planar and nearly triangulated, with perturbed-grid and Delaunay-based random models providing the closest matches among those tested.
citing papers explorer
-
Fused Gromov-Wasserstein Distance with Feature Selection
Fused Gromov-Wasserstein distances are extended with feature selection via Lasso/Ridge regularization or simplex-constrained weights, yielding theoretical bounds, metric properties, and an alternating minimization algorithm.
-
Census Dual Graphs: Properties and Random Graph Models
Census dual graphs are characterized as nearly planar and nearly triangulated, with perturbed-grid and Delaunay-based random models providing the closest matches among those tested.