Network alignment by discrete Ollivier-Ricci flow

DOI10.1007/978-3-030-04414-5_32OpenAlexW2891096760MaRDI QIDQ1725779

Xianqiang Yang

Publication date: 15 February 2019

Full work available at URL: https://arxiv.org/abs/1809.00320

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

GraphRicciCurvature ⋮ Non-negative Ollivier curvature on graphs, reverse Poincaré inequality, Buser inequality, Liouville property, Harnack inequality and eigenvalue estimates

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logarithmic Harnack inequalities
• Ricci curvature of graphs
• Ricci curvature of Markov chains on metric spaces
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
• Three-manifolds with positive Ricci curvature
• Fifty years of graph matching, network alignment and network comparison
• Ricci curvature for metric-measure spaces via optimal transport
• Practical graph isomorphism. II.
• A rough curvature-dimension condition for metric measure spaces
• On the geometry of metric measure spaces. I
• Incremental graph pattern matching
• On convex relaxation of graph isomorphism
• Emergence of Scaling in Random Networks
• The small-world phenomenon
• Triangulation and embedding using small sets of beacons
• Ricci-Ollivier Curvature of the Rooted Phylogenetic Subtree-Prune-Regraft Graph
• A Two-Stage Deanonymization Attack against Anonymized Social Networks
• Graph isomorphism in quasipolynomial time [extended abstract]
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• How to Draw a Graph

This page was built for publication: Network alignment by discrete Ollivier-Ricci flow