Entropy flow on weighted graphs provides a rigorous, convergent framework for evolving distributions on graphs and achieves community detection accuracy comparable to Ricci flow at a small fraction of the computational cost.
Evolution of weights on a connected finite graph.arXiv:2411.06393, 2024
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
A discrete Ricci flow on graphs converges exponentially to prescribed Lin-Lu-Yau curvatures iff attainable, with an explicit max-edge-density condition for constant curvature on girth-at-least-6 graphs.
The Calabi flow on finite graphs converges globally if and only if a weight function exists realizing the prescribed curvature, with convergence for constant curvature under topological conditions.
citing papers explorer
-
An Efficient Entropy Flow on Weighted Graphs: Theory and Applications
Entropy flow on weighted graphs provides a rigorous, convergent framework for evolving distributions on graphs and achieves community detection accuracy comparable to Ricci flow at a small fraction of the computational cost.
-
The Ricci flow with prescribed curvature on graphs
A discrete Ricci flow on graphs converges exponentially to prescribed Lin-Lu-Yau curvatures iff attainable, with an explicit max-edge-density condition for constant curvature on girth-at-least-6 graphs.
-
The Calabi flow with prescribed curvature on finite graphs
The Calabi flow on finite graphs converges globally if and only if a weight function exists realizing the prescribed curvature, with convergence for constant curvature under topological conditions.