Skip to content
Preprint

Idleness Functions for Ollivier-Ricci Curvature on Hypergraphs

Aug 2026 · 0 citations · 10 references
Mathematics

Abstract

Let $\mathcal H=(V,E)$ be a locally finite simple hypergraph, equip $V$ with the hyperpath metric, and consider the equal-edges random walk \cite{CoupetteEtAl2023}. 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}.

View source

Similar papers

Preprint Aug 2026

Structure theorems for Lichnerowicz-sharp graphs

Hypercube graphs are fundamental model spaces of positive curvature in discrete comparison geometry. Let $G$ be a finite, connected, simple, unweighted graph with Bakry--\'Emery curvature bounded below by $K$. We call $G$ Lichnerowicz-sharp if its first non-zero non-normalized Laplacian eigenvalue $\lambda_1=K$. We pro...

Yanlong Ding, Shiping Liu, Chiyu Zhou · 0 citations
Preprint Sep 2026

Weighted isoperimetry implies percolation

Consider an infinite edge-weighted graph satisfying an isoperimetric inequality of the type $\|\partial A\|\geq C|A|^\alpha$ for some $\alpha,C>0$, where $\|\partial A\|$ denotes the weighted size of the edge boundary of $A$. We prove that, for $C$ large enough depending on $\alpha$, if each edge is open independently...

Ivailo Hartarsky, Franco Severo, Augusto Teixeira · 1 citation
Preprint Sep 2026

An Alon-Boppana Bound for the Non-Backtracking Operator

For any fixed $k$, we prove a lower bound on the $k$th largest modulus of an eigenvalue of the non-backtracking matrix $B$. Specifically, consider any deterministic or random family of graphs that converges locally to the unimodular Galton-Watson tree with root degree distribution $D$, and set $\kappa:=\mathbb E[D(D-1)...

Theo McKenzie · 1 citation
Preprint Sep 2026

On Counting Independent Sets in Regular Hypergraphs

Balogh, Bollob\'as and Narayanan conjectured that among all finite simple $r$-uniform $d$-regular hypergraphs, the number of weak independent sets is maximized by a natural quasi-bipartite construction $H_{r,d}$. We give three types of evidence for this conjecture. For every fixed $r$, we prove the conjectured asymptot...

Michail Sarantis, P. Tetali, Zeyu Zheng · 0 citations
Preprint Oct 2026

Core Coordinates and Negative Support in A-Hypergeometric Systems

For a homogeneous $A$-hypergeometric system, let $K_v$ be the intersection of the negative support family for a fake exponent $v$, and let $C_w$ be the set of indices of variables that do not occur in any minimal monomial generator of $\operatorname{in}_w(I_A)$. We prove that $K_v=\operatorname{nsupp}(v)\cap C_w$ holds...

M. Nagamine · 0 citations
Preprint Sep 2026

Sharp Lovasz-Theta Bounds on Random Graphs

It is well known that the \Lovasz-Theta function of a random graph $G(n,\tfrac{1}{2})$ is $\Theta(\sqrt{n})$. More precisely, it is tightly concentrated in the interval \( [\sqrt{n},\, 2\sqrt{n}], \) where the upper bound follows from an explicit dual witness for the associated semidefinite program. Numerical evidence...

Aaron Potechin, Jeff Xu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.