{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/network-alignment-by-discrete-ollivier-ricci","title":"Network Alignment by Discrete Ollivier-Ricci Flow","arxiv_id":"1809.00320","date":"2018-09-02","proceeding":null,"authors":["Chien-Chun Ni","Yu-Yao Lin","Jie Gao","Xianfeng David Gu"],"abstract":"In this paper, we consider the problem of approximately aligning/matching two graphs. Given two graphs $G_{1}=(V_{1},E_{1})$ and $G_{2}=(V_{2},E_{2})$, the objective is to map nodes $u, v \\in G_1$ to nodes $u',v'\\in G_2$ such that when $u, v$ have an edge in $G_1$, very likely their corresponding nodes $u', v'$ in $G_2$ 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 neighborhood is connected. The graph Ricci flow uniformizes discrete Ricci curvature and induces a Ricci flow metric that is insensitive to node/edge insertions and deletions. With the new metric, we can map a node in $G_1$ to a node in $G_2$ whose distance vector to only a few preselected landmarks is the most similar. The robustness of the graph metric makes it outperform other methods when tested on various complex graph models and real world network data sets (Emails, Internet, and protein interaction networks)\\footnote{The source code of computing Ricci curvature and Ricci flow metric are available: https://github.com/saibalmars/GraphRicciCurvature}.","url_abs":"http://arxiv.org/abs/1809.00320v2","url_pdf":"http://arxiv.org/pdf/1809.00320v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"network-alignment-by-discrete-ollivier-ricci","repo_url":"https://github.com/saibalmars/GraphRicciCurvature","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.00320","atlas_url":"https://app.syntology.ai/?focus=1809.00320","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}