Related papers: Total Curvature of Graphs after Milnor and Euler
Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…
We present a generic solution to the fundamental problem of how to connect two points in a plane by a smooth curve that goes through these points with a given slope. The smoothness of any curve depends both on its curvature and its length.…
The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…
Real-world graphs have inherently complex and diverse topological patterns, known as topological heterogeneity. Most existing works learn graph representation in a single constant curvature space that is insufficient to match the complex…
A new isoperimetric estimate is proved for embedded closed curves evolving by curve shortening flow, normalized to have total length $2\pi$. The estimate bounds the length of any chord from below in terms of the arc length between its…
An integral geometric curvature is defined as the index expectation K(x) = E[i(x)] if a probability measure m is given on vector fields on a Riemannian manifold or on a finite simple graph. Such curvatures are local, satisfy Gauss-Bonnet…
Graph neural networks (GNNs) have emerged as a fundamental tool for learning from graph-structured data, achieving strong performance across a wide range of applications. However, understanding their generalization capabilities remains…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Gromov conjectured that the total mean curvature of the boundary of a compact Riemannian manifold can be estimated from above by a constant depending only on the boundary metric and on a lower bound for the scalar curvature of the fill-in.…
Graph neural networks (GNNs) have achieved great success in many graph-based tasks. Much work is dedicated to empowering GNNs with the adaptive locality ability, which enables measuring the importance of neighboring nodes to the target node…
Let $m:=|E(G)|$ sufficiently large and $s:=(m-1)/3$. We show that unless the maximum degree $\Delta > 2s$, there is a weighting $w:E\cup V\to \{0,1,...,s\}$ so that $w(uv)+w(u)+w(v)\ne w(u'v')+w(u')+w(v')$ whenever $uv\ne u'v'$ (such a…
Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…
Given a definable function f, enough differentiable, we study the continuity of the total curvature function t --> K(t), total curvature of the level {f=t}, and the total absolute curvature function t-->|K| (t), total absolute curvature of…
For a mean curvature flow of complete graphical hypersurfaces $M_{t}=\operatorname{graph} u(\cdot,t)$ defined over domains $\Omega_{t}$, the enveloping cylinder is $\partial\Omega_{t}\times\mathbb{R}$. We prove the smooth convergence of…
We prove local and global upper estimates for the infimum of the mean curvature, the scalar curvature and the norm of the shape operator of graphs in a warped product space. Using these estimates, we obtain some results on pseudo-hyperbolic…
In this paper we establish new simple local geometric criteria for discrete entropic curvature introduced in [47] that are powerful enough to capture many geometric properties of complex models arising in mathematical physics. These results…
In [5], S\'aez and Schn\"urer studied the graphical mean curvature flow of complete hypersurfaces defined on subsets of Euclidean space. They obtained long time existence. Moreover, they provided a new interpretation of weak mean curvature…
The geodesic total curvature of rectifiable spherical curves is analyzed. We extend to the case of high dimension spheres the explicit formula that holds true for curves supported into the 2-sphere. For this purpose, we take advantage of…
This paper introduces the concept of compliant vertices and compliant graphs, with a focus on the total domination degree (TDD) of a vertex in compliant graphs. The TDD is systematically calculated for various graph classes, including path…
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…