Search arXivSearch

arXiv · 2606.16530

Lin--Lu--Yau Ricci Curvature of Digraphs via Optimal Transport Couplings

Abstract

In this paper, we study the Lin--Lu--Yau Ricci curvature of strongly connected locally finite digraphs through an explicit optimal-coupling construction. For an arc of a digraph, we derive a computable curvature formula by constructing a coupling between the probability measures at its tail and head, and by proving its optimality using a suitable $1$-Lipschitz function. The formula is not only effective for direct computation, but also unifies several known results: in particular, it recovers the Lin--Lu--Yau Ricci curvature formula for Cayley graphs of Right-Angled Artin--Coxeter Hybrid groups as a special case and gives shorter proofs of curvature results arising from matching-type conditions. We then characterize arcs with zero Ricci curvature through perfect distance matching and perfect distance partitions. We further prove that, under suitable assumptions, such arc curvature in directed Cayley graphs increases when an inverse generator or a new generator is added to the generating set. As applications, we compute the curvature of directed Cayley graphs of dihedral groups and generalized quaternion groups, including $Γ(D_n,\{a,b\})$, $Γ(Q_{4m},\{a,b\})$, $Γ(Q_{4m},\{a,a^{-1},b\})$ and $Γ(Q_{4m},\{a,b,b^{-1}\})$. Finally, we provide an algorithm for computing the Lin--Lu--Yau Ricci curvature of Cayley graphs of finitely generated groups with prescribed generating sets, together with complete curvature tables for several important families of finite groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kevin Fung, Johnny Lim. 2026-06-15. Lin--Lu--Yau Ricci Curvature of Digraphs via Optimal Transport Couplings. https://arxiv.org/abs/2606.16530

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO