For r-uniform linear hypergraphs with nonnegative Lin-Lu-Yau curvature, edge-connectivity equals minimum incidence degree, while nonlinear examples violate this with arbitrarily large gaps.
Idleness Functions for Ollivier-Ricci Curvature on Hypergraphs
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Let $\mathcal H=(V,E)$ be a locally finite simple hypergraph, equip $V$ with the hyperpath metric, and consider the lazy random walk introduced for hypergraph Ollivier--Ricci curvature by Tian and Zhao \cite{TianZhao2025}. For adjacent vertices $x$ and $y$, we prove that the idleness function $\alpha\mapsto\kappa_\alpha^{\mathcal H}(x,y)$ is piecewise affine and with no more than three affine pieces. A separate mass-balance argument gives linearity on $[1/2,1]$ for every locally finite simple hypergraph and, consequently, a limit-free expression for the Lin--Lu--Yau curvature. In the $r$-uniform linear case, the hypergraph walk agrees exactly with the simple random walk on its 2-section. This reduction transfers the sharp endpoint intervals of Bourne, Cushing, Liu, M\"unch, and Peyerimhoff \cite{BourneEtAl2018}.
citation-role summary
citation-polarity summary
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1roles
method 1polarities
support 1representative citing papers
citing papers explorer
-
Edge-connectivity and LLY curvature of hypergraphs
For r-uniform linear hypergraphs with nonnegative Lin-Lu-Yau curvature, edge-connectivity equals minimum incidence degree, while nonlinear examples violate this with arbitrarily large gaps.