Related papers: Lin-Lu-Yau Ricci curvature on hypergraphs

We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.

We propose a new graph kernel for graph classification and comparison using Ollivier Ricci curvature. The Ricci curvature of an edge in a graph describes the connectivity in the local neighborhood. An edge in a densely connected…

We classify all connected, simple, 3-regular graphs with girth at least 5 that are Ricci-flat. We use the definition of Ricci curvature on graphs given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct. Anal.,…

This survey describes some recent rigidity results obtained by the authors for the prescribed mean curvature problem on graphs $u : M \rightarrow \mathbb{R}$. Emphasis is put on minimal, CMC and capillary graphs, as well as on graphical…

The classical Liouville theorem states that a bounded harmonic function on all of $\RR^n$ must be constant. In the early 1970s, S.T. Yau vastly generalized this, showing that it holds for manifolds with nonnegative Ricci curvature.…

Characterizing shapes of high-dimensional objects via Ricci curvatures plays a critical role in many research areas in mathematics and physics. However, even though several discretizations of Ricci curvatures for discrete combinatorial…

We introduce a new approach for computing curvature of sub-Riemannian manifolds. Curvature is here meant as symplectic invariants of Jacobi curves of geodesics, as introduced by Zelenko and Li. We describe how they can be expressed using a…

Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…

This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…

We explore properties of generalized Paley graphs and we extend a result of Lim and Praeger by providing a more precise description of the connected components of disconnected generalized Paley graphs. This result leads to a new…

In this article we prove that antitrees with suitable growth properties are examples of infinite graphs exhibiting strictly positive curvature in various contexts: in the normalized and non-normalized Bakry-\'Emery setting as well in the…

Ricci curvature and its associated flow offer powerful geometric methods for analyzing complex networks. While existing research heavily focuses on applications for undirected graphs such as community detection and core extraction, there…

We present a notion of super Ricci flow for time-dependent finite weighted graphs. A challenging feature is that these flows typically encounter singularities where the underlying graph structure changes. Our notion is robust enough to…

We give rigidity results for the discrete Bonnet-Myers diameter bound and the Lichnerowicz eigenvalue estimate. Both inequalities are sharp if and only if the underlying graph is a hypercube. The proofs use well-known semigroup methods as…

In this paper we derive Cheng-Yau, Li-Yau, Hamilton estimates for Riemannian manifolds with Bakry-Emery Ricci curvature bounded from below, and also global and local upper bounds, in terms of Bakry-Emery Ricci curvature, for the Hessian of…

We study a new notion of Ricci curvature that applies to Markov chains on discrete spaces. This notion relies on geodesic convexity of the entropy and is analogous to the one introduced by Lott, Sturm, and Villani for geodesic measure…

The connection between curvature and topology is a very well-studied theme in the subject of differential geometry. By suitably defining curvature on networks, the study of this theme has been extended into the domain of network analysis as…

Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…

A comparison theorem for the isoperimetric profile on the universal cover of surfaces evolving by normalised Ricci flow is proven. For any initial metric, a model comparison is constructed that initially lies below the profile of the…

We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms…