Related papers: Curvature on Graphs via Equilibrium Measures

We study the Dirichlet problem for minimal surface systems in arbitrary dimension and codimension via mean curvature flow, and obtain the existence of minimal graphs over arbitrary mean convex bounded $C^2$ domains for a large class of…

An orthogonal representation of a graph is an assignment of nonzero real vectors to its vertices such that distinct non-adjacent vertices are assigned to orthogonal vectors. We prove general lower bounds on the dimension of orthogonal…

We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…

In this paper, we provide the notions of connection $1$-forms and curvature $2$-forms on graphs. We prove a Weitzenb\"ock formula for connection Laplacians in this setting. We also define a discrete Yang-Mills functional and study its…

We study the sub-Finsler prescribed mean curvature equation, associated to a strictly convex body $K_0 \subseteq \mathbb{R}^{2n}$, for $t$-graphs on a bounded domain $\Omega$ in the Heisenberg group $\mathbb{H}^n$. When the prescribed datum…

A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…

We study a half-space problem related to graphs in $\mathbb{H}^2\times\mathbb{R}$, where $\mathbb{H}^2$ is the hyperbolic plane, having constant mean curvature $H$ defined over unbounded domains in $\mathbb{H}^2$.

On a closed manifold, consider the space of all Riemannian metrics for which -Delta + kR is positive (nonnegative) definite, where k > 0 and R is the scalar curvature. This spectral generalization of positive (nonnegative) scalar curvature…

We prove various inequalities measuring how far from an isometry a local map from a manifold of high curvature to a manifold of low curvature must be. We consider the cases of volume-preserving, conformal and quasi-conformal maps. 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…

It is known that for $\Omega \subset \mathbb{R}^{2}$ an unbounded convex domain and $H>0$, there exists a graph $G\subset \mathbb{R}^{3}$ of constant mean curvature $H$ over $\Omega $ with $\partial G=$ $\partial \Omega $ if and only if…

Coudert et al. (SODA'18) proved that under the Strong Exponential-Time Hypothesis, for any $\epsilon >0$, there is no ${\cal O}(2^{o(k)}n^{2-\epsilon})$-time algorithm for computing the diameter within the $n$-vertex cubic graphs of…

The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. By appropriately introducing a weight to each edge of a graph, we determine, among other thing, the skewness of the generalized Petersen…

We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the…

In the first part Busemann concavity as non-negative curvature is introduced and a bi-Lipschitz splitting theorem is shown. Furthermore, if the Hausdorff measure of a Busemann concave space is non-trivial then the space is doubling and…

A comparison theorem for the isoperimetric profile on the universal cover of surfaces evolving by normalised Ricci flow is proven. For any initial metric, a model comparison is constructed that initially lies below the profile of the…

The goal of this short paper to advertise the method of gauge transformations (aka holographic reduction, reparametrization) that is well-known in statistical physics and computer science, but less known in combinatorics. As an application…

We use moving frame techniques to derive a notion of curvature for a class of piecewise-smooth Riemannian metrics called Regge metrics, showing that it is a measure that simultaneously satisfies the (weak) Cartan structure equations and the…

A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S . The domination number of G, denoted by $\gamma$(G), is the minimum cardinality of a dominating set in G. In a breakthrough…

For studying topological obstructions to graph colorings, Hom-complexes were introduced by Lov\'{a}sz. A graph $T$ is called a test graph if for every graph $H$, the $k$-connectedness of $|Hom(T, H)|$ implies $\chi (H)\geq k + 1 + \chi(T)$.…