Related papers: Ollivier-Ricci Curvature for Hypergraphs: A Unifie…

There are several interrelated notions of discrete curvature on graphs. Many approaches utilize the optimal transportation metric on its probability simplex or the distance matrix of the graph. In this survey article, we compute formulas…

We prove improved bounds on how localized an eigenvector of a high girth regular graph can be, and present examples showing that these bounds are close to sharp. This study was initiated by Brooks and Lindenstrauss (2009) who relied on the…

Although scalar curvature is the simplest curvature invariant, our understanding of scalar curvature has not matured to the same level as Ricci or sectional curvature. Despite this fact, many rigidity phenomenon have been established which…

We develop a numerical method for realizing mean curvature motion of interfaces separating multiple phases, whose areas are preserved throughout time. The foundation of the method is a thresholding algorithm of the Bence-Merriman-Osher…

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…

Mapping complex input data into suitable lower dimensional manifolds is a common procedure in machine learning. This step is beneficial mainly for two reasons: (1) it reduces the data dimensionality and (2) it provides a new data…

An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…

Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads…

Analysis of Internet topologies has shown that the Internet topology has negative curvature, measured by Gromov's "thin triangle condition", which is tightly related to core congestion and route reliability. In this work we analyze the…

Building on the recently introduced notion of quantum Ricci curvature and motivated by considerations in nonperturbative quantum gravity, we advocate a new, global observable for curved metric spaces, the curvature profile. It is obtained…

We introduce Forman-Ricci curvature and its corresponding flow as characteristics for complex networks attempting to extend the common approach of node-based network analysis by edge-based characteristics. Following a theoretical…

Based on two classical notions of curvature for curves in general metric spaces, namely the Menger and Haantjes curvatures, we introduce new definitions of sectional, Ricci and scalar curvature for networks and their higher dimensional…

We investigate the topology of the compact hypersurfaces in round spheres whose Ricci curvature satisfies an appropriate bound that only depends on the mean curvature of the submanifold. In this paper, the use of the Bochner technique…

I propose a quantum gravity model in which geometric space emerges from random bits in a quantum phase transition driven by the combinatorial Ollivier-Ricci curvature and corresponding to the condensation of short cycles in random graphs.…

Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic…

We define the Ricci curvature of Markov chains on metric spaces as a local contraction coefficient of the random walk acting on the space of probability measures equipped with a Wasserstein transportation distance. For Brownian motion on a…

Hyperbolic geometry has emerged as an effective latent space for representing complex networks, owing to its ability to capture hierarchical organization and heterogeneous connectivity patterns using low-dimensional embeddings. As a result,…

A geometric graph is a graph embedded in the plane with vertices at points and edges drawn as curves (which are usually straight line segments) between those points. The average transversal complexity of a geometric graph is the number of…

We describe a few elementary aspects of the circle of ideas associated with a quantum field theory (QFT) approach to Riemannian Geometry, a theme related to how Riemannian structures are generated out of the spectrum of (random or quantum)…

Ollivier and Lin--Lu--Yau established the theory of graph Ricci curvature (LLY curvature) via optimal transport on graphs. Ikeda--Kitabeppu--Takai--Uehara introduced a new distance called the Kantorovich difference on hypergraphs and…