Curvature on graphs via equilibrium measures

From MaRDI portal
Publication:6074588



Abstract: We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by K>0 have diameter bounded by mboxdiam(G)leq2/K (a Bonnet-Myers theorem), that mboxdiam(G)=2/K implies that G has constant curvature (a Cheng theorem) and that there is a spectral gap lambda1geqK/(2n) (a Lichnerowicz theorem). It is computed for several families of graphs and often coincides with Ollivier curvature or Lin-Lu-Yau curvature. The von Neumann minimax theorem features prominently in the proofs.




Cites work









This page was built for publication: Curvature on graphs via equilibrium measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074588)