Optimal transport distances for directed, weighted graphs: a case study with cell-cell communication networks

arXiv:2309.07030v3 Announce Type: replace
Abstract: Comparing graphs by means of optimal transport has recently gained significant attention, as the distances induced by optimal transport provide both a principled metric between graphs as well as an interpretable description of the associated changes between graphs in terms of a transport plan. As the lack of symmetry introduces challenges in the typically considered formulations, optimal transport distances for graphs have mostly been developed for undirected graphs. Here, we propose two distance measures to …

abstract arxiv attention case case study communication cs.lg cs.si cs.sy eess.sy graphs networks q-bio.gn q-bio.mn study terms transport type