Discrete curvature on graphs from the effective resistance
From MaRDI portal
Publication:6388441
DOI10.1088/2632-072X/AC730DarXiv2201.06385MaRDI QIDQ6388441FDOQ6388441
Authors: Karel Devriendt, Renaud Lambiotte 
Publication date: 17 January 2022
Abstract: This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably, we find a relation to a number of well-established discrete curvatures (Ollivier, Forman, combinatorial curvature) and show evidence for convergence to continuous curvature in the case of Euclidean random graphs. Being both efficient to calculate and highly amenable to theoretical analysis, these resistance curvatures have the potential to shed new light on the theory of discrete curvature and its many applications in mathematics, network science, data science and physics.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Discrete geometry (52C99) Discrete differential geometry (53A70) Applications of differential geometry to data and computer science (53Z50)
This page was built for publication: Discrete curvature on graphs from the effective resistance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6388441)
