Pith. sign in

Idleness Functions for Ollivier-Ricci Curvature on Hypergraphs

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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

method 1

citation-polarity summary

fields

math.CO 1

years

2026 1

verdicts

CONDITIONAL 1

roles

method 1

polarities

support 1

representative citing papers

Edge-connectivity and LLY curvature of hypergraphs

math.CO · 2026-08-06 · conditional · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Edge-connectivity and LLY curvature of hypergraphs math.CO · 2026-08-06 · conditional · none · ref 13 · internal anchor

    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.