analiza aiqbench
This thesis bridges differential geometry and machine learning by extending Ollivier-Ricci curvature from Riemannian manifolds to directed graphs, offering new theoretical bounds for network science and graph neural networks. The work provides rigorous mathematical foundations that could enhance the structural understanding of complex AI models beyond standard Euclidean assumptions.
Ollivier-Ricci Curvature of Riemannian Manifolds and Directed Graphs with Applications to Graph Neural Networks
arXiv:2604.14211v2 Announce Type: replace-cross Abstract: This thesis is an exposition of Ollivier-Ricci Curvature of metric spaces as introduced by Yann Ollivier, which is based upon the 1-Wasserstein Distance and optimal transport theory. We present some of the major results and proofs that connect Ollivier-Ricci curvature with classical Ricci curvature of Riemannian manifolds, including extensions of various theoretical bounds and theorems such as Bonnet-Myers and Levy-Gromov. Then we shift to results introduced by Lin-Lu-Yau on an extension of Ollivier-Ricci curvature on graphs, as well as the work of Jost-Liu on proving various combinatorial bounds for graph Ollivier-Ricci curvature. At the end of this thesis we present novel ideas and proofs regarding extensions of these results to directed graphs, and finally applications of graph-based Ollivier-Ricci curvature to various algorithms in network science and graph machine learning.
Abstract:This thesis is an exposition of Ollivier-Ricci Curvature of metric spaces as introduced by Yann Ollivier, which is based upon the 1-Wasserstein Distance and optimal transport theory. We present some of the major results and proofs that connect Ollivier-Ricci curvature with classical Ricci curvature of Riemannian manifolds, including extensions of various theoretical bounds and theorems such as Bonnet-Myers and Levy-Gromov. Then we shift to results introduced by Lin-Lu-Yau on an extension of Ollivier-Ricci curvature on graphs, as well as the work of Jost-Liu on proving various combinatorial bounds for graph Ollivier-Ricci curvature. At the end of this thesis we present novel ideas and proofs regarding extensions of these results to directed graphs, and finally applications of graph-based Ollivier-Ricci curvature to various algorithms in network science and graph machine learning.
Differential Geometry (math.DG); Artificial Intelligence (cs.AI); Social and Information Networks (cs.SI); Combinatorics (math.CO)
arXiv:2604.14211 [math.DG]
(or arXiv:2604.14211v2 [math.DG] for this version)
https://doi.org/10.48550/arXiv.2604.14211 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 231 cuvinte
Subiecte conexe
PersonaManifold: Revealing and Exploiting Curved Geometry in LLM Persona Representations
arXiv · 29 sept. 2026
From Direction to Magnitude: How Multimodal Instruction-Tuning Reorganizes the Geometric Encoding of Identity-Specifying Prompts in Transformer Hidden States
arXiv · 4 aug. 2026
Discrete Ricci Curvature on Protein Contact Graphs for Lightweight Fold Classification
arXiv · 21 iul. 2026
Geometric Flow enhanced Graph Coarsening
arXiv · 16 sept. 2026