Related papers: Weak Kantorovich difference and associated Ricci c…
We introduce the notion of Bonnet-Myers and Lichnerowicz sharpness in the Ollivier Ricci curvature sense. Our main result is a classification of all self-centered Bonnet-Myers sharp graphs (hypercubes, cocktail party graphs,…
We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prekopa-Leindler type…
We prove diameter bounds for graphs having positive Ricci-curvature bound in Bakry-Emery sense. One result using only curvature and maximal vertex degree is sharp in case of hypercubes. The other result depends on an additional dimension…
We introduce new definitions of sectional, Ricci and scalar curvature for networks and their higher dimensional counterparts, derived from two classical notions of curvature for curves in general metric spaces, namely, the Menger curvature…
A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in [7]. This connection and its extensions were successfully employed in optimization to provide heuristics…
Let $G$ be a graph on $n\geq 3$ vertices. A graph $G$ is almost distance-hereditary if each connected induced subgraph $H$ of $G$ has the property $d_{H}(x,y)\leq d_{G}(x,y)+1$ for any pair of vertices $x,y\in V(H)$. A graph $G$ is called…
We study the optimal transport problem on globally hyperbolic spacetimes associated with Orlicz-type Lorentzian cost functions of the form $u \circ \ell$, where $u$ is a suitable monotonically increasing and concave function, and $\ell$ is…
We prove certain localized and global differential Harnack inequality for all positive solutions to the geometric conjugate heat equation coupled to the forward in time Ricci flow. In this case, the diffusion operator is perturbed with the…
In this paper we give local curvature estimates for the Laplacian flow on closed G_2-structures under the condition that the Ricci curvature is bounded along the flow. The main ingredient consists of the idea of Kotschwar-Munteanu-Wang who…
We investigate the stability of timelike Ricci curvature lower bounds under low-regularity limits of Lorentzian metrics. Specifically, we prove that the synthetic curvature-dimension condition $TCD^e_p(K,N)$, which provides an optimal…
In this note we consider distinct distances determined by points in an integer lattice. We first consider Erdos's lower bound for the square lattice, recast in the setup of the so-called Elekes-Sharir framework \cite{ES11,GK11}, and show…
Let $M$ denote a low-dimensional manifold embedded in Euclidean space and let ${X}= \{ x_1, \dots, x_n \}$ be a collection of points uniformly sampled from it. We study the relationship between the curvature of a random geometric graph…
A fundamental tool in the analysis of Ricci flow is a compactness result of Hamilton in the spirit of the work of Cheeger, Gromov and others. Roughly speaking it allows one to take a sequence of Ricci flows with uniformly bounded curvature…
We analyse divergences of the scalar curvature $R$ of the vector multiplet moduli space of type IIA string theory compactified on a Calabi--Yau $X$, along infinite-distance large volume limits. Extending previous results, we classify the…
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.,…
We study the long scale Ollivier-Ricci curvature of graphs as a function of the chosen idleness. As in the previous work on the short scale, we show that this idleness function is concave and piecewise linear with at most $3$ linear parts.…
Community detection is an important problem in graph neural networks. Recently, algorithms based on Ricci curvature flows have gained significant attention. It was suggested by Ollivier (2009), and applied to community detection by Ni et al…
The computation of resistance distance is pivotal in a wide range of graph analysis applications, including graph clustering, link prediction, and graph neural networks. Despite its foundational importance, efficient algorithms for…
In this paper we prove a compactness result for Ricci flows with bounded scalar curvature and entropy. It states that given any sequence of such Ricci flows, we can pass to a subsequence that converges to a metric space which is smooth away…
One of the most well-known results in the theory of optimal transportation is the equivalence between the convexity of the entropy functional with respect to the Riemannian Wasserstein metric and the Ricci curvature lower bound of the…