Paperlane

no. 14 · Friday 13 November 2026

Lin–Lu–Yau Curvature and Edge-Connectivity of Hypergraphs

Qing Xia

math.CO · v4 · 31 pp

Abstract

We give a local geometric criterion ensuring that the edge-connectivity of a hypergraph equals its minimum incidence degree: every locally finite connected simple $r$-uniform linear hypergraph with $r\ge3$ and nonnegative Lin–Lu–Yau curvature has this property. Among the various extensions of Ollivier–Ricci curvature to hypergraphs, we work with the equal-edges random walk on hypergraphs \cite{CoupetteEtAl2023}. Moreover, we show that both uniformity and linearity are essential: if either assumption is removed, there exist positively curved hypergraphs for which the gap between minimum incidence degree and edge-connectivity is arbitrarily large. For adjacent vertices in any locally finite simple hypergraph, the Ollivier–Ricci idleness function is concave and piecewise affine with at most three affine pieces, and is affine on $[1/2,1]$. In particular, $κ_{\LLY}=2κ_{1/2}$, which we use to verify positive curvature in the two families of examples.

comments
31 pages
fields
Combinatorics, Probability
pdf ↗ page arXiv:2608.06029 ↗