Ricci Flow on Weighted Digraphs with Balancing Factor

Ricci curvature and Ricci flow have proven to be powerful tools for analyzing the geometry of discrete structures, particularly on undirected graphs, where they have been applied to tasks ranging from community detection to graph representation learning. However, their development on directed graphs remains limited, with Ricci flow being especially underexplored. In this work, we introduce a rigorous formulation of Ricci flow on directed weighted graphs, which evolves edge weights while preserving distances, and establish both the existence and uniqueness of its solutions. To capture the essence of asymmetry in directed networks and to enhance the capability of modeling more flexible structures, we incorporate a node-wise balancing factor that regulates between outflow and inflow. Building on the continuous Ricci flow evolution framework, we propose a discrete Ricci flow algorithm that is applicable to numerical computing. Numerical studies on various directed graph examples demonstrate the capacity of the proposed flow to reveal structural asymmetry and dynamic evolutions.