Papers › Piecewise-linear Ricci curvature flows on weighted graphs
Piecewise-linear Ricci curvature flows on weighted graphs
Jicheng Ma, Yunyan Yang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Community detection is an important problem in graph neural networks. Recently, algorithms based on Ricci curvature flows have gained significant attention. It was suggested by Ollivier (2009), and applied to community detection by Ni et al (2019) and Lai et al (2022). Its mathematical theory was due to Bai et al (2024) and Li-M\"unch (2025). In particular, solutions to some of these flows have existence, uniqueness and convergence. However, a unified theoretical framework has not yet been established in this field. In the current study, we propose several unified piecewise-linear Ricci curvature flows with respect to arbitrarily selected Ricci curvatures. First, we prove that the flows have global existence and uniqueness. Second, we show that if the Ricci curvature being used is homogeneous, then after undergoing multiple surgeries, the evolving graph has a constant Ricci curvature on each connected component. Note that five commonly used Ricci curvatures, which were respectively defined by Ollivier, Lin-Lu-Yau, Forman, Menger and Haantjes, are all homogeneous, and that the proof of all these results is independent of the choice of the specific Ricci curvature. Third, as an application, we apply the discrete piecewise-linear Ricci curvature flow with surgeries to the problem of community detection. On three real-world datasets, the flow consistently outperforms baseline models and existing methods. Complementary experiments on synthetic graphs further confirm its scalability and robustness. Compared with existing algorithms, our algorithm has two advantages: it does not require curvature calculations at each iteration, and the iterative process converges.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections