Papers › Evolution of weights on a connected finite graph

Evolution of weights on a connected finite graph

10 Nov 2024arXiv:2411.06393links table onlyarchive 2025-07-28

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.

On a connected finite graph, we propose an evolution of weights including Ollivier's Ricci flow as a special case. During the evolution process, on each edge, the speed of change of weight is exactly the difference between the Wasserstein distance related to two probability measures and certain graph distance. Here the probability measure may be chosen as an α-lazy one-step random walk, an α-lazy two-step random walk, or a general probability measure. Based on the ODE theory, we show that the initial value problem has a unique global solution. A discrete version of the above evolution is applied to the problem of community detection. Our algorithm is based on such a discrete evolution, where probability measures are chosen as α-lazy one-step random walk and α-lazy two-step random walk respectively. Note that the later measure has not been used in previous works [2, 16, 21, 24]. Here, as in [21], only one surgery needs to be performed after the last iteration. Moreover, our algorithm is much easier than those of [2, 16, 21], which were all based on Lin-Lu-Yau's Ricci curvature. The code is available at https://github.com/mjc191812/Evolution-of-weights-on-a-connected-finite-graph.

PaperPDFCode

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