Related papers: Weak Kantorovich difference and associated Ricci c…
In this paper, we study curvature dimension conditions on birth-death processes which correspond to linear graphs, i.e., weighted graphs supported on the infinite line or the half line. We give a combinatorial characterization of Bakry and…
The relationship between the perturbation theory in light-front coordinates and Lorentz-covariant perturbation theory is investigated. A method for finding the difference between separate terms of the corresponding series without their…
It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph…
In this paper, we introduce a new notion of curvature on the edges of a graph that is defined in terms of effective resistances. We call this the Ricci--Foster curvature. We study the Ricci flow resulting from this curvature. We prove the…
We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…
In this note we provide a combinatorial interpretation for the powers of the hypergraph Laplacians. Our motivation comes from the discrete formulation of quantum mechanics and thermodynamics in the case of finite graphs, which suggest a…
Lubiw showed that several variants of Graph Isomorphism are NP-complete, where the solutions are required to satisfy certain additional constraints [SICOMP 10, 1981]. One of these, called Isomorphism With Restrictions, is to decide for two…
An upper bound for the Kantorovich transport distance between probability measures on multidimensional Euclidean spaces is given in terms of transport distances between one dimensional projections. This quantifies the Cram\'er-Wold…
We study the curvature-dimension inequality in regular graphs. We develop techniques for calculating the curvature of such graphs, and we give characterizations of classes of graphs with positive, zero, and negative curvature. Our main…
This paper deals with locally constrained inverse curvature flows in a broad class of Riemannian warped spaces. For a certain class of such flows we prove long time existence and smooth convergence to a radial coordinate slice. In the case…
In this paper, we establish the relation between classic invariants of graphs and their integer Laplacian eigenvalues, focusing on a subclass of chordal graphs, the strictly chordal graphs, and pointing out how their computation can be…
Applying a well-known theorem due to Eidelheit, we give a short proof of the surjectivity of the combinatorial Laplacian on connected locally finite undirected simplicial graph $G$ with countably infinite vertex set $V$, established by…
In this paper we discuss cylindrical extensions of improved Hardy, Sobolev type and Caffarelli-Kohn-Nirenberg type inequalities with sharp constants and identities in the spirit of Badiale-Tarantello [2]. All identities are obtained in the…
In this paper, we discuss the Hamiltonicity of graphs in terms of Wiener index, hyper-Wiener index and Harary index of their quasi-complement or complement. Firstly, we give some sufficient conditions for an balanced bipartite graph with…
It is observed that on a compact almost complex Calabi-Yau with torsion 6-manifold the Nijenhuis tensor is parallel with respect to the torsion connection. If the torsion is closed then the space is a compact generalized gradient Ricci…
The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to $t$-path traceability. We show how traceability behaves…
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in…
We define and study two new kinds of "effective resistances" based on hubs-biased -- hubs-repelling and hubs-attracting -- models of navigating a graph/network. We prove that these effective resistances are squared Euclidean distances…
We present a framework for embedding graph structured data into a vector space, taking into account node features and topology of a graph into the optimal transport (OT) problem. Then we propose a novel distance between two graphs, named…
Ricci curvature is a fundamental concept in differential geometry for encoding local geometric structure, and its graph-based analogues have recently gained prominence as practical tools for reweighting, pruning, and reshaping network…