相关论文: Ollivier Ricci Curvature of Directed Hypergraphs
In a previous work, the authors have introduced a Lin-Lu-Yau type Ricci curvature for directed graphs, and obtained a diameter comparison of Bonnet-Myers type. In this paper, we investigate rigidity properties for the equality case, and…
We develop a new and systematic method for proving entropic Ricci curvature lower bounds for Markov chains on discrete sets. Using different methods, such bounds have recently been obtained in several examples (e.g., 1-dimensional birth and…
Let (M, g) be a compact Einstein Riemannian manifold with boundary. We show that under certain conditions, the map that associates to a metric on M its Ricci curvature, its induced conformal class on the boundary, and its mean curvature on…
In this paper we study the inverse eigenvector centrality problem on directed graphs: given a prescribed node centrality profile, we seek edge weights that realize it. Since this inverse problem generally admits infinitely many solutions,…
Threshold graphs are a prevalent and widely studied class of simple graphs. They have several equivalent definitions which makes them a go-to class for finding examples and counter examples when testing and learning. This versatility has…
There has been a great deal of research on graphs defined on algebraic structures in the last two decades. In this paper we begin an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
This note surveys some classical results and recent developments on the interplay between lower curvature bounds and the isoperimetric problem. It is based on mini-courses given at the European Doctorate School of Differential Geometry…
Consider the unnormalized Ricci flow $(g_{ij})_t = -2R_{ij}$ for $t\in [0,T)$, where $T < \infty$. Richard Hamilton showed that if the curvature operator is uniformly bounded under the flow for all times $t\in [0,T)$ then the solution can…
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…
On a connected finite graph, we propose an evolution of weights including Ollivier's Ricci flow as a special case. During the evolution process, on each edge, the speed of change of weight is exactly the difference between the Wasserstein…
In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).
We prove distance bounds for graphs possessing positive Bakry-\'Emery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits…
The curvature discussed in this paper is a rather far going generalization of the Riemannian sectional curvature. We define it for a wide class of optimal control problems: a unified framework including geometric structures such as…
The monitoring of large dynamic networks is a major chal- lenge for a wide range of application. The complexity stems from properties of the underlying graphs, in which slight local changes can lead to sizable variations of global prop-…
The prescribed Ricci curvature problem in the context of G-invariant metrics on a homogeneous space M=G/K is studied. We focus on the metrics at which the Ricci curvature map is, locally, as injective and surjective as it can be. Our main…
In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…
We study orientability in spaces with Ricci curvature bounded below. Building on the theory developed by Honda, we establish equivalent characterizations of orientability for Ricci limit and RCD spaces in terms of the orientability of their…
We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…
A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…