Related papers: A brief note about p-curvature on graphs
Let $\mathcal{H}$ be a given finite (possibly empty) family of connected graphs, each containing a cycle, and let $G$ be an arbitrary finite $\mathcal{H}$-free graph with minimum degree at least $k$. For $p \in [0,1]$, we form a $p$-random…
Let $k$ be a field of characteristic $p,$ and $f : X \to S$ a smooth proper morphism of smooth $k$-schemes. Katz's formula gives a relationship between the Kodaira--Spencer map of $f,$ and an invariant called the $p$-curvature of the…
Tackling semi-supervised learning problems with graph-based methods has become a trend in recent years since graphs can represent all kinds of data and provide a suitable framework for studying continuum limits, e.g., of differential…
We introduce the notion of integral Ricci curvature $I_{\kappa_0}$ for graphs, which measures the amount of Ricci curvature below a given threshold $\kappa_0$. We focus our attention on the Lin-Lu-Yau Ricci curvature. As applications, we…
Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…
The role of curvature in relation with Lie algebra contractions of the pseudo-ortogonal algebras so(p,q) is fully described by considering some associated symmetrical homogeneous spaces of constant curvature within a Cayley-Klein framework.…
We characterize positive critical Hardy weights for general Laplacians on weighted graphs. We then apply this result to fractional Laplacians on general graphs and use the characterization to identify an optimal Hardy weight under suitable…
Inspired by persistent homology in topological data analysis, we introduce the homological eigenvalues of the graph $p$-Laplacian $\Delta_p$, which allows us to analyse and classify non-variational eigenvalues. We show the stability of…
Let $(X,d)$ be a compact metric space. We consider the behavior of probability measures $\mu$ with the property that $$ \int_{X} d(x, y) d\mu(y) \qquad \mbox{is independent of}~x \in X.$$ It appears that such measures, when they exist,…
In this article we derive an explicit diameter bound for graphs satisfying the so-called curvature dimension conditions $CD(K,n)$. This refines a recent result due to Liu, M\"unch and Peyerimhoff when the dimension $n$ is finite.
Long time existence and convergence to a circle is proved for radial graph solutions to a mean curvature type curve flow in warped product surfaces (under a weak assumption on the warp potential of the surface). This curvature flow…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
We investigate the Ollivier-Ricci curvature and its modification introduced by Lin, Lu, and Yau on locally finite graphs. The main contribution of this work is a lower bound on the minimum vertex degree of a graph ensuring non-negative…
For integers r and k > 0(k>r),a conditional (k, r)-coloring of a graph G is a proper k-coloring of G such that every vertex v of G has at least min{r,d(v)} differently colored neighbors, where d(v) is the degree of v. In this note, for…
In this paper, we prove two Liouville-type theorems for capillary minimal graph over $\mathbb{R}^n_+$. First, if $u$ has linear growth, then for $n=2,3$ and for any $\theta\in(0,\pi)$, or $n\geq4$ and $\theta\in(\frac{\pi}6,\frac{5\pi}6)$,…
We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…
We extend the range of $N$ to negative values in the $(K,N)$-convexity (in the sense of Erbar--Kuwada--Sturm), the weighted Ricci curvature $Ric_N$ and the curvature-dimension condition $CD(K,N)$. We generalize a number of results in the…
We prove that edge contractions do not preserve the property that a set of graphs has bounded clique-width. This property is preserved by contractions of edges, one end of which is a vertex of degree 2.
Let $\Gamma$ be a metric graph having a linear system $g^r_{2r}$ for some $2 \leq r \leq g-2$ then $\Gamma$ has a linear system $g^1_2$. This is similar to the well-known Clifford's Theorem from the theory of linear systems on smooth…
If $G$ is a graph then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v) = d_G(u,v)$ where $d$ is the distance function. We say a graph $G$ is $distance\ preserving\ (dp)$ if it has an isometric…