On the Relation between Graph Ricci Curvature and Community Structure
Sathyanarayanan Rengaswami, Theodora Bourni, Vasileios Maroulas
TL;DR
The paper addresses the relationship between graph curvature and community structure using Ollivier-Ricci curvature. It harnesses optimal transport on graphs to bound the Wasserstein distance $W(m_x,m_y)$ between edge-endpoint distributions, yielding a theorem that constrains the curvature of intercommunity edges in terms of community sizes $m,n$ and the count of intercommunity edges $k$. A precise inequality $k \le \frac{-m+\sqrt{m^2+4(m-1)(2n-1)}}{2}$ guarantees $\kappa(e) \le 0$ for all intercommunity edges between two communities, and the paper demonstrates sharpness via zero- and positive-curvature configurations alongside empirical tests. The results provide guidance for curvature-based community detection and deepen understanding of how intercommunity connectivity shapes local geometric properties on graphs.
Abstract
The connection between curvature and topology is a very well-studied theme in the subject of differential geometry. By suitably defining curvature on networks, the study of this theme has been extended into the domain of network analysis as well. In particular, this has led to curvature-based community detection algorithms. In this paper, we reveal the relation between community structure of a network and the curvature of its edges. In particular, we give apriori bounds on the curvature of intercommunity edges of a graph.
