Network Alignment by Discrete Ollivier-Ricci Flow
Chien-Chun Ni, Yu-Yao Lin, Jie Gao, Xianfeng David Gu

TL;DR
This paper introduces a novel graph alignment method using discrete Ricci flow metrics, which enhances robustness and accuracy in matching complex networks like social, internet, and biological graphs.
Contribution
The work proposes a new network alignment approach based on Ricci flow metrics, improving robustness to network modifications and outperforming existing methods on real-world data.
Findings
Outperforms existing methods on complex network datasets
Robust to node and edge insertions/deletions
Effective in aligning biological and social networks
Abstract
In this paper, we consider the problem of approximately aligning/matching two graphs. Given two graphs and , the objective is to map nodes to nodes such that when have an edge in , very likely their corresponding nodes in are connected as well. This problem with subgraph isomorphism as a special case has extra challenges when we consider matching complex networks exhibiting the small world phenomena. In this work, we propose to use `Ricci flow metric', to define the distance between two nodes in a network. This is then used to define similarity of a pair of nodes in two networks respectively, which is the crucial step of network alignment. %computed by discrete graph curvatures and graph Ricci flows. Specifically, the Ricci curvature of an edge describes intuitively how well the local…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Complex Network Analysis Techniques · Graph Theory and Algorithms
