Papers › A modified Ricci flow on arbitrary weighted graph
A modified Ricci flow on arbitrary weighted graph
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.
In this paper, we propose a modified Ricci flow, as well as a quasi-normalized Ricci flow, on arbitrary weighted graph. Each of these two flows has a unique global solution. In particular, these global existence and uniqueness results do not require an exit condition proposed by Bai et al in a recent work [2]. As applications, these two Ricci flows are applied to community detection for complex networks, including Karate Club, American football games, Facebook, as well as artificial networks. In our algorithms, unlike in [5,15], there is no need to perform surgery at every iteration, only one surgery needs to be performed after the last iteration. From three commonly used criteria for evaluating community detection algorithms, ARI, NMI and Q, we conclude that our algorithms outperform existing algorithms, including Ollivier's Ricci flow [5], normalized Ollivier's Ricci flow and normalized Lin-Lu-Yau's Ricci flow [15]. The codes for our algorithms are available at https://github.com/mjc191812/Modified-Ricci-Flow.
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