相关论文: Ollivier Ricci Curvature of Directed Hypergraphs

We express the discrete Ricci curvature of a graph as the minimal eigenvalue of a family of matrices, one for each vertex of a graph whose entries depend on the local adjaciency structure of the graph. Using this method we compute or bound…

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…

The Ollivier curvature has important applications in discrete geometry and network theory, in particular as a measure of local clustering. The Ollivier curvature is defined in terms of the Wasserstein distance which, in the discrete…

For undirected graphs, the Ricci curvature introduced by Lin-Lu-Yau has been widely studied from various perspectives, especially geometric analysis. In the present paper, we discuss generalization problem of their Ricci curvature for…

The transmission of a connected hypergraph is defined as the summation of distances between all unordered pairs of distinct vertices. We determine the unique uniform unicyclic hypergraphs of fixed size with minimum and maximum…

This is the lecture notes on the interplay between optimal transport and Riemannian geometry. On a Riemannian manifold, the convexity of entropy along optimal transport in the space of probability measures characterizes lower bounds of the…

Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…

In this paper, we show that the Ricci curvature lower bound in Ollivier's Wasserstein metric sense of a continuous time jumping Markov process on a graph can be characterized by some optimal coupling generator and provide the construction…

We study the curvature-dimension inequality in regular graphs. We develop techniques for calculating the curvature of such graphs, and we give characterizations of classes of graphs with positive, zero, and negative curvature. Our main…

We introduce the weighted orthogonal Ricci curvature -- a two-parameter version of Ni--Zheng's orthogonal Ricci curvature. This curvature serves as a very natural object in the study of the relationship between the Ricci curvature(s) and…

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…

Graph Ricci curvature is crucial as it geometrically quantifies network structure. It pinpoints bottlenecks via negative curvature, identifies cohesive communities with positive curvature, and highlights robust hubs. This guides network…

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 define a hybrid between Ollvier and Bakry Emery curvature on graphs with dependence on a variable neighborhood. The hexagonal lattice is non-negatively curved under this new curvature notion. Bonnet-Myers diameter bounds and Lichnerowicz…

The characterization of complex networks with tools originating in geometry, for instance through the statistics of so-called Ricci curvatures, is a well established tool of network science. There exist various types of such Ricci…

We give a new upper bound for the average graph distance in terms of the average Ollivier curvature. Here, the average Ollivier curvature is weighted with the edge betweenness centrality. Moreover, we prove that equality is attained…

We study Ollivier-Ricci curvature, a discrete version of Ricci curvature, which has gained popularity over the past several years and has found applications in diverse fields. However, the Ollivier-Ricci curvature requires an optimal mass…

In this paper, we define the curvature dimension inequalities CD(m, K) on finite directed graphs modifying the case of undirected graphs. As a main result, we evaluate m and K on finite directed graphs.

In this paper, we consider the problem of approximately aligning/matching two graphs. Given two graphs $G_{1}=(V_{1},E_{1})$ and $G_{2}=(V_{2},E_{2})$, the objective is to map nodes $u, v \in G_1$ to nodes $u',v'\in G_2$ such that when $u,…

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.