Optimal transport distances for directed, weighted graphs: a case study with cell-cell communication networks
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 compare directed graphs based on variants of optimal transport: (i) an earth movers distance (Wasserstein) and (ii) a Gromov-Wasserstein (GW) distance. We evaluate these two distances and discuss their relative performance for both simulated graph data and real-world directed cell-cell communication graphs, inferred from single-cell RNA-seq data.
- “L-graal: Lagrangian graphlet-based network aligner,” Bioinformatics, vol. 31, no. 13, pp. 2182–2189, 2015.
- “Graph kernels,” Journal of Machine Learning Research, vol. 11, pp. 1201–1242, 2010.
- “Got: An optimal transport framework for graph comparison,” arXiv preprint arXiv:1906.02085, 2019.
- “Gromov-wasserstein learning for graph matching and node embedding,” in International conference on machine learning. PMLR, 2019, pp. 6932–6941.
- “Computational optimal transport: With applications to data science,” Foundations and Trends® in Machine Learning, vol. 11, no. 5-6, pp. 355–607, 2019.
- “A new notion of effective resistance for directed graphs—part ii: Computing resistances,” IEEE Transactions on Automatic Control, vol. 61, no. 7, pp. 1737–1752, 2015.
- “A metric on directed graphs and markov chains based on hitting probabilities,” SIAM Journal on Mathematics of Data Science, vol. 3, no. 2, pp. 467–493, 2021.
- “CrossTalkeR: analysis and visualization of ligand–receptorne tworks,” Bioinformatics, vol. 37, no. 22, pp. 4263–4265, 05 2021.
- “Matching node embeddings for graph similarity,” in Proceedings of the AAAI Conference on Artificial Intelligence, 2017, vol. 31,1.
- Asuka Takatsu, “On wasserstein geometry of gaussian measures,” in Probabilistic approach to geometry, pp. 463–472. Mathematical Society of Japan, 2010.
- “Comparing directed networks via denoising graphlet distributions,” Journal of Complex Networks, vol. 11, no. 2, pp. cnad006, 2023.
- Facundo Mémoli, “Gromov–wasserstein distances and the metric approach to object matching,” Foundations of computational mathematics, vol. 11, no. 4, pp. 417–487, 2011.
- “The gromov–wasserstein distance between networks and stable network invariants,” Information and Inference: A Journal of the IMA, vol. 8, no. 4, pp. 757–787, 2019.
- M Randić and DJ Klein, “Resistance distance,” J. Math. Chem, vol. 12, pp. 81–95, 1993.
- “Resistance distance,” Journal of mathematical chemistry, vol. 12, pp. 81–95, 1993.
- “Minimizing effective resistance of a graph,” SIAM review, vol. 50, no. 1, pp. 37–66, 2008.
- “A new notion of effective resistance for directed graphs—part i: Definition and properties,” IEEE Transactions on Automatic Control, vol. 61, no. 7, pp. 1727–1736, 2015.
- “On the stability of the kuramoto model of coupled nonlinear oscillators,” in Proceedings of the 2004 American Control Conference. IEEE, 2004, vol. 5, pp. 4296–4301.
- “The pagerank citation ranking: Bring order to the web,” Tech. Rep., Technical report, Stanford University, 1998.
- David F Gleich, “Pagerank beyond the web,” siam REVIEW, vol. 57, no. 3, pp. 321–363, 2015.
- “Comparing partitions,” Journal of classification, vol. 2, pp. 193–218, 1985.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.