Pith. sign in

REVIEW 1 cited by

Idleness Functions for Ollivier-Ricci Curvature on Hypergraphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2608.01970 v1 pith:YTO4HHU2 submitted 2026-08-03 math.CO math.PR

classification math.COmath.PR
keywords hypergraphcurvaturesimplewalkaffinealphacitefinite
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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}.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Edge-connectivity and LLY curvature of hypergraphs

    math.CO 2026-08 conditional novelty 6.0 of 10

    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.

Pith tools