Ricci curvature of graphs

376 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A simple yet effective baseline for non-attribute graph classification (2018, background): “, we have experimented adding other node features(also more expansive to compute) such as closeness centrality, Fiedler vector(the second smallest eigenvectors of graph Laplacian), and Ricci curvature[LLY11] of graphs. Interestingly, we observe that none of the above features yields any significant ”
Li–Yau inequality on finite graphs via non-linear curvature dimension conditions (2014, background): “On graphs, it has been studied in [5, 6, 10, 13, 15, 16].”
Bakry–Émery Curvature Functions on Graphs (2016, methodology): “2]); Lin-Lu-Yau’s modified Ollivier-Ricci curvature [24] on each edge of Km,n is 2/max{m,n} [37, Section 5].”
Ollivier Ricci curvature for general graph Laplacians: Heat equation, Laplacian comparison, non-explosion and diameter bounds (2017, methodology): “ning the heat semigroup with a cutoﬀ function, which we call the perpetual cutoﬀ method. Our curvature notion will be a generalized Ollivier curvature based on its modiﬁcation by Lin, Lu and Yau (see [LLY11]) which we extend to the case of general graph Laplacians. In particular, we now apply this c”
Understanding over-squashing and bottlenecks on graphs via curvature (2021, methodology): “We are now ready to deﬁne the Ollivier Ricci curvature: the formulation below is due to Lin et al. (2011).”