Ollivier–Ricci Curvature

In Riemannian differential geometry, Ricci curvature (Ric) quantifies how the local volume of a geodesic ball—or the distance between two small spheres transported along parallel geodesics—deviates from flat Euclidean space (κ = 0): on a positively curved sphere (κ > 0), parallel geodesics converge so balls are closer together than their centers, whereas on a negatively curved hyperbolic saddle (κ < 0), geodesics diverge exponentially (exp(√|κ|·d)). Because molecular structures, human pangenome variation graphs (GFA), and protein Residue Interaction Networks (RINs) are discrete mathematical graphs G = (V, E, w) rather than smooth differentiable manifolds, classical partial differential operators cannot be applied directly.

Ollivier–Ricci curvature (κ_OR, introduced by Yann Ollivier in 2007–2009) and Forman–Ricci combinatorial curvature (κ_FR, Robin Forman, 2003) solve this problem by lifting Ricci curvature to discrete metric spaces via 1-Wasserstein optimal transport (Earth Mover's Distance, W1) and CW-complex combinatorics, complemented by Topological Data Analysis (TDA) and the first Betti number (β1 = |E| − |V| + C). Paired with spectral graph theory (graph Laplacian and Fiedler value), discrete Ricci curvature provides a parameter-free geometric diagnostic across structural biophysics and genomics: edges embedded inside densely interconnected α-helices, β-sheets, or conserved haplotype cliques exhibit positive curvature (κ_OR > 0), whereas inter-domain allosteric bottleneck bridges, cryptic ligand-binding hinges (KRAS Switch-II, EGFR, ALK), and pangenome structural-variant recombination breakpoints (CACNA1C, CYP2D6, APOE) exhibit strongly negative curvature (κ_OR < −0.35).

Lazy Random-Walk Probability Measures and 1-Wasserstein Optimal Transport (W1)

Let G = (V, E, w) be an undirected, connected, positively weighted graph with vertex set V, edge set E, shortest-path metric d(u, v), and vertex degree deg(u) = ∑_{x ~ u} w(u, x). To compare the local geometry around two adjacent vertices u and v connected by an edge e = (u, v) ∈ E, Ollivier–Ricci curvature replaces the infinitesimal geodesic sphere around each vertex with a one-step lazy random-walk probability measure μ_u^α supported on u and its immediate 1-hop neighborhood N(u) (with laziness parameter α ∈ [0, 1), conventionally α = 0 or α = 0.5):

• μ_u^α(x) = α, if x = u
• μ_u^α(x) = (1 − α) × [w(u, x) / deg(u)], if (u, x) ∈ E
• μ_u^α(x) = 0, otherwise.

The 1-Wasserstein distance (W1, Kantorovich–Rubinstein / Earth Mover's Distance) between the two neighborhood probability distributions μ_u^α and μ_v^α is defined as the minimum total transport cost required to move probability mass from μ_u^α to μ_v^α across the graph metric d(x, y), solved via linear programming:

W1(μ_u^α, μ_v^α) = inf_{Π ∈ Γ(μu^α, μv^α)} ∑_{x ∈ V} ∑_{y ∈ V} Π(x, y) · d(x, y)

where Γ(μ_u^α, μ_v^α) is the set of all joint coupling matrices Π(x, y) ≥ 0 whose row and column marginals equal μ_u^α and μ_v^α. The Ollivier–Ricci curvature κ_OR(u, v) along edge e = (u, v) is then defined as:

κ_OR(u, v) = 1 − [ W1(μ_u^α, μ_v^α) / d(u, v) ]

Geometric Interpretation (κ_OR > 0, κ_OR = 0, κ_OR < 0), Forman–Ricci (κ_FR), and Betti Number (β1)

The sign and magnitude of κ_OR(u, v) (bounded within [−2, +1) for α = 0) reflect three canonical local graph topologies:

1. Positively Curved Cliques and Triangles (κ_OR > 0): When u and v belong to a complete clique K_n or share many common neighbors (triangles), their neighborhood distributions μ_u^α and μ_v^α overlap heavily, so very little probability mass needs to be moved (W1 < d(u, v)), yielding κ_OR > 0 (analogous to a sphere).
2. Flat Grid Lattices (κ_OR = 0): On a regular 2D Cartesian grid Z² or cycle where N(u) and N(v) can be translated in parallel by distance d(u, v), W1(μ_u^α, μ_v^α) = d(u, v), yielding κ_OR = 0.
3. Negatively Curved Bottleneck Bridges and Trees (κ_OR < 0): When e = (u, v) is a cut-edge bridge or hyperbolic tree branch connecting two high-degree hubs (deg(u), deg(v) ≫ 1) that share no common neighbors or short cycles, transporting mass from N(u) \ {v} to N(v) \ {u} requires every path to traverse N(u) → u → v → N(v) (3× the edge length d(u, v)), driving W1 > d(u, v) and yielding strongly negative curvature (κ_OR → −1.0 to −2.0).

For ultra-large pangenome graphs (>10⁶ edges) where solving linear programs per edge is computationally intensive, Forman–Ricci curvature (κ_FR) provides an O(1) combinatorial approximation for unweighted 1-dimensional graphs (κ_FR(u, v) = 4 − deg(u) − deg(v) + 3 × |Δ(u, v)| when augmented with 2-cell triangles Δ(u, v)), while the first Betti number (β1 = |E| − |V| + C, where C is the number of connected components) measures the global rank of the 1st homology group H1(G)—counting the exact number of independent topological cycles (nested structural-variant bubbles or reticulate recombination loops).

Bidirected Sequence Graphs and Nested Bubble Cyclomatic Complexity (β1)

In the Human Pangenome Reference Consortium (HPRC) and microbial pangenomics, multi-assembly variation is encoded as a bidirected Graphical Fragment Assembly (GFA) sequence graph G = (V, E), where vertices v ∈ V (S-lines) represent conserved nucleotide sequence segments (1 bp to >10 kb) and edges e ∈ E (L-lines) represent observed haplotype transitions between segments across phased assemblies (CHM13-T2T, GRCh38, and 94+ diploid human haplotypes).

In collinear, non-recombining housekeeping regions, the pangenome graph reduces to a simple chain interspersed with isolated single-nucleotide polymorphism (SNP) superbubbles (2-vertex, 2-edge diamonds where β1 increments by +1 per biallelic SNP). By contrast, medically complex structural-variant (SV) loci—such as the Intron 3 30-bp tandem CACNA1C psychiatric enhancer VNTR (Chr12p13.33), the CYP2D6–CYP2D7 (Chr22q13.2) pharmacogenomic hybrid tandem duplication locus, the APOE–TOMM40 (Chr19q13.32) Alzheimer's locus, and the MHC Class III C4A/C4B (RCCX) module—exhibit elevated cyclomatic loop complexity (β1 / |V| > 0.35) due to nested indel bubbles, copy-number cycles, and non-allelic homologous recombination (NAHR).

Negative Ollivier–Ricci Curvature (κ_OR < −0.40) at Structural-Variant Breakpoints

Computing κ_OR(u, v) across HPRC pangenome graphs reveals a striking geometric dichotomy:

1. Conserved Flanks vs. Divergent Alt-Allele Bubbles: Edges sitting precisely at structural-variant entry/exit breakpoints (bifurcation/reconvergence anchor nodes) where a conserved diploid reference stem (high haplotype traversal weight, deg ≥ 4) splits into multiple mutually exclusive structural haplotypes (such as a 6.4 kb HERV insertion, an Alu-mediated inversion, or a VNTR repeat array) exhibit strongly negative Ollivier–Ricci curvature (κ_OR = −0.42 to −1.25). Because haplotype paths diverge onto non-overlapping alternative bubbles without short triangular cross-links, the 1-Wasserstein transport distance W1(μ_u, μ_v) expands across the bubble perimeter.
2. Ricci Flow Community Decomposition (Ricci-Flow Surgery): Analogous to Grigori Perelman's Ricci flow with surgery on 3-manifolds (d/dt g_ij = −2 Ric_ij), discrete Ollivier–Ricci flow iteratively updates edge weights via d^(k+1)(u, v) = d^(k)(u, v) × (1 − κ_OR^(k)(u, v)): positively curved intra-haplotype blocks contract (d → 0), while negatively curved recombination/breakpoint bridges stretch exponentially (d(t) ≈ d(0) · exp(|κ_OR| · t) → ∞). Cutting edges whose stretched distance exceeds a threshold automatically partitions complex pangenome graphs into orthologous haplotype synteny blocks (haploblocks) without arbitrary window sizes.

Allosteric Signal Transmission Along Negative-Curvature Bridges (KRAS, EGFR, ALK)

Any three-dimensional protein structure (PDB or AlphaFold3 coordinates) can be represented as an atomic-level Residue Interaction Network (RIN) in which each amino acid residue i (Cα or Cβ atom) is a vertex v_i ∈ V and an edge (v_i, v_j) ∈ E is placed whenever two residues form non-covalent heavy-atom contacts within d ≤ 4.5–5.0 Å (weighted by hydrogen-bond, salt-bridge, or direct coupling analysis (DCA) Potts evolutionary epistatic energy ||J_ij||).

Within a globular protein RIN:

• Rigid Secondary-Structure Cores (κ_OR > +0.20): Residues inside α-helices (i to i+3, i+4 hydrogen-bonded cliques) and β-sheets form dense triangular contact meshes with strongly positive Ollivier–Ricci curvature, acting as rigid mechanical blocks.
• Allosteric Bottleneck Bridges (κ_OR < −0.35 and High Edge Betweenness): Long-range allosteric communication between a distal regulatory pocket and an orthosteric catalytic site—such as between the KRAS Switch-II cryptic pocket (His95/Tyr96/Cys12) and the effector-binding Switch-I loop (residues 30–38), or between the EGFR αC-helix (Leu858Arg) and the Cys797 hinge—must funnel through a small number of inter-subdomain contact bridges. Because these inter-domain hinge edges connect two dense, quasi-independent RIN communities with minimal local triangulation, they display sharp negative Ollivier–Ricci curvature minima (κ_OR = −0.38 to −0.85) coupled with high shortest-path edge betweenness centrality (C_B(e)).

Synergy with Cryptic Pocket Prediction (PocketMiner) and Mutational Escape Analysis

Integrating discrete κ_OR curvature with geometric deep learning (PocketMiner graph neural networks, Meller et al., 2023) and algebraic connectivity (Fiedler value λ2) enables rapid structural drug discovery across the human proteome:

1. Cryptic Allosteric Pocket Identification: Static apo crystal structures often appear flat and undruggable (KRAS, HIF-2α PAS-B, SHP2, MYC). Scanning the apo RIN for clusters of surface-adjacent edges with strongly negative κ_OR < −0.35 and low local Fiedler algebraic connectivity (Δλ2 sensitivity upon edge removal) pinpoints mechanically compliant inter-lobe hinges capable of opening into druggable cryptic cavities during microsecond molecular dynamics fluctuations.
2. Allosteric Resistance Mutation Mapping: Somatic cancer resistance mutations that occur outside the primary orthosteric drug pocket (such as KRAS Y96D/R68S or ALK L1198F) map disproportionately to negative-curvature bottleneck nodes (κ_OR < −0.40) that gate the conformational transition between the active and inactive states.

How does Ollivier–Ricci curvature (κ_OR) differ from standard graph clustering coefficient or edge betweenness centrality?

Whereas the local clustering coefficient counts only 3-node triangles (cycles of length 3) and fails entirely on bipartite graphs, grids, or 4-/5-membered rings (where clustering = 0), Ollivier–Ricci curvature (κ_OR) uses optimal transport (W1) across the full graph metric and gracefully distinguishes flat 4-cycles (κ_OR = 0 on a 2D grid) from negatively curved trees (κ_OR < 0). Conversely, while edge betweenness centrality (C_B) is a global O(|V|·|E|) path-counting metric sensitive to distant graph boundary artifacts, κ_OR is a strictly intrinsic, local 1-hop geometric invariant computable independently on every edge in parallel.

Why is Forman–Ricci curvature (κ_FR) often augmented with 2-dimensional triangular faces (Δ) in biological networks?

In Robin Forman's original 1-dimensional CW-complex formula for a simple graph without 2-cells (κ_FR(u, v) = 4 − deg(u) − deg(v)), every edge connecting vertices of degree > 2 automatically receives a negative value—even inside a complete clique K_n where the geometry is maximally spherical! Augmented Forman–Ricci curvature (Samal et al., 2018) promotes 3-cycles (triangles Δ(u, v)) to 2-dimensional simplicial faces, adding +3 × |Δ(u, v)| to the curvature formula so that triangle-dense protein α-helices and haplotype cliques correctly yield positive curvature (κ_FR > 0), matching κ_OR with r > 0.85 correlation at 100× faster runtime.

How do persistent homology barcodes (Topological Data Analysis) complement Ollivier–Ricci curvature in protein folding and pangenomics?

While Ollivier–Ricci curvature measures local metric convergence/divergence along individual edges, Persistent Homology (TDA) grows a continuous filtration radius r (Vietoris–Rips or Alpha simplicial complex) across 3D protein coordinates or pairwise genomic distance matrices and tracks the birth (r_birth) and death (r_death) of topological features across dimensions: H0 (connected components), H1 (1D loops / tunnels / reticulate recombination cycles), and H2 (2D enclosed cavities / cryptic ligand pockets such as the 290 ų HIF-2α PAS-B cavity). Combining H2 persistence lifetimes (r_death − r_birth) with surrounding κ_OR < −0.35 hinge edges identifies cavities that are both volumetrically large enough to bind a drug (H2) and mechanically accessible (κ_OR).

1. Ollivier, Y. (2009). "Ricci curvature of Markov chains on metric spaces." Journal of Functional Analysis, 256(3), 810–864. https://doi.org/10.1016/j.jfa.2008.11.001
2. Sandhu, R., Georgiou, T., Reznik, E., et al. (2015). "Graph curvature for differentiating cancer networks." Scientific Reports, 5(1), 12323. https://doi.org/10.1038/srep12323
3. Sia, J., Jonckheere, E., & Bogdan, P. (2019). "Ollivier-Ricci curvature-based method to community detection in complex networks." Scientific Reports, 9(1), 9800. https://doi.org/10.1038/s41598-019-46079-x
4. Meller, A., Ward, M., Borowsky, J., et al. (2023). "Accelerating cryptic pocket discovery using AlphaFold." Nature Communications, 14(1), 1177. https://doi.org/10.1038/s41467-023-36699-3