A python library to compute the graph Ricci curvature and Ricci flow on NetworkX graph.
cvxpy
to ot.emd2
since it's way faster (up to 10x) for OTD cases within neighbor counts 2000 x 2000.OTDSinkhornMix
that uses ot.emd2
to compute OTD for smaller neighbors (less than _OTDSinkhorn_threshold=2000
in default setting). This is because Sinkhorn works faster for larger cases, for smaller cases, the iterating process makes it slower than directly compute the ot.emd2
written in C.nbr_topk
to be 3000 because of the faster computations.warning
to trace
since the Ricci flow "converges" faster with exact Wasserstein distance.Add ricci_community
for auto community detection.
The Bidirectional Dijkstra pairwise shortest path by Networkit having some problem on a larger graph, add an option for the user to select the shortest path engine, default is by all pairs shortest path, but may require more memory for larger graph.