相关论文: The Graph Curvature Calculator and the curvatures …
We study the Bakry-\'Emery curvature function $\mathcal{K}_{G,x}:(0,\infty]\to \mathbb{R}$ of a vertex $x$ in a locally finite graph $G$ systematically. Here $\mathcal{K}_{G,x}(\mathcal{N})$ is defined as the optimal curvature lower bound…
In \cite{Chan95}, the authors classified the 2-extendable abelian Cayley graphs and posed the problem of characterizing all 2-extendable Cayley graphs. We first show that a connected bipartite Cayley (vertex-transitive) graph is…
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…
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.
Derivation-based differential calculi are of great importance in noncommutative geometry, noncommutative gauge theory and integrable systems. In this paper, we propose the connection and curvature from a class of deformed derivation-based…
A graph is cubical if it is a subgraph of a hypercube. For a cubical graph $H$ and a hypercube $Q_n$, $ex(Q_n, H)$ is the largest number of edges in an $H$-free subgraph of $Q_n$. If $ex(Q_n, H)$ is equal to a positive proportion of the…
In this paper, we consider Wang's $CD_p(m,K)$ condition on graphs, which depends on the $p$-Laplacian $\Delta_p$ for $p>1$ and is an extension of the classical Bakry-\'Emery $CD(m,K)$ curvature dimension condition. We calculate several…
We introduce a new definition of nonpositive curvature in metric spaces and study its relationship to the existing notions of nonpositive curvature in comparison geometry. The main feature of our definition is that it applies to all metric…
A set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost. The distinguishing costs of vertex transitive cubic graphs…
In this article, we prove gradient estimates under Bakry-Emery curvature bounds for unbounded graph Laplacians which satisfy an ellipticity assumption. As applications, we study completeness and finiteness of stochastically complete graphs…
In this sequence of two papers, we introduce a curvature flow on (mixed) weighted graphs which is based on the Bakry-\'Emery calculus. The flow is described via a time-continuous evolution through the weighting schemes. By adapting this…
One of the main obstacles regarding Barky Emery curvature on graphs is that the results require a global uniform lower curvature bounds where no exception sets are allowed. We overcome this obstacle by introducing the perpetual cutoff…
Real-world graphs naturally exhibit hierarchical or cyclical structures that are unfit for the typical Euclidean space. While there exist graph neural networks that leverage hyperbolic or spherical spaces to learn representations that embed…
A graph algorithm is truly subquadratic if it runs in ${\cal O}(m^b)$ time on connected $m$-edge graphs, for some positive $b < 2$. Roditty and Vassilevska Williams (STOC'13) proved that under plausible complexity assumptions, there is no…
In this paper we consider global $\theta$-curvatures of finite Markov chains with associated means $\theta$ in the spirit of the entropic curvature (based on the logarithmic mean) by Erbar-Maas and Mielke. As in the case of Bakry-\'Emery…
We study algorithms for drawing planar graphs and 1-planar graphs using cubic B\'ezier curves with bounded curvature. We show that any n-vertex 1-planar graph has a 1-planar RAC drawing using a single cubic B\'ezier curve per edge, and this…
We study the Ollivier-Ricci curvature of graphs as a function of the chosen idleness. We show that this idleness function is concave and piecewise linear with at most $3$ linear parts, with at most $2$ linear parts in the case of a regular…
In this note we prove that any closed graph manifold admitting a metric of non-positive sectional curvature (NPC-metric) has a finite cover, which is fibered over the circle. An explicit criterion to have a finite cover, which is fibered…
A graph $G$ with four or more vertices is called bicritical if the removal of any pair of distinct vertices of $G$ results in a graph with a perfect matching. A bicritical graph is minimal if the deletion of each edge results in a…
In this paper, we classify unweighted graphs satisfying the curvature dimension condition CD(0,\infty) whose girth are at least five.