Related papers: Curvature dimension inequalities on directed graph…
In this paper we explore mathematical tools that can be used to relate directed and undirected random graph models to each other. We identify probability spaces on which a directed and an undirected graph model are equivalent, and…
We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…
Let G be an n-vertex graph with m edges. The degree deviation measure of G is defined as s(G)=sum v in V(G)|degG(v)-(2m/n)|, where n and m are the number of vertices and edges of G, respectively. The aim of this paper is to prove the…
We consider surfaces with parallel mean curvature vector field and finite total curvature in product spaces of type $\mathbb{M}^n(c)\times\mathbb{R}$, where $\mathbb{M}^n(c)$ is a space form, and characterize certain of these surfaces. When…
It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…
We follow up on previous work which found that commonly used graph evolution moves lead to conserved quantities that can be expressed in terms of the braiding of the graph in its embedding space. We study non-embedded graphs under three…
We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…
In this note a new measure of irregularity of a simple undirected graph $G$ is introduced. It is named the total irregularity of a graph and is defined as $\irr_t(G) = 1/2\sum_{u,v \in V(G)} |d_G(u)-d_G(v)|$, where $d_G(u)$ denotes the…
The computation of the optical conductivity of strained and deformed graphene is discussed within the framework of quantum field theory in curved spaces. The analytical solutions of the Dirac equation in an arbitrary static background…
We study Gauss curvature for random Riemannian metrics on a compact surface, lying in a fixed conformal class; our questions are motivated by comparison geometry. Next, analogous questions are considered for the scalar curvature in…
The curvature dimension condition CD(K,N), pioneered by Sturm and Lott--Villani, is a synthetic notion of having curvature bounded below and dimension bounded above, in the non-smooth setting. This condition implies a suitable…
In this paper, we introduce a new graph structure, called the $direct~ sum ~graph$ on a finite dimensional vector space. We investigate the connectivity, diameter and the completeness of $\Gamma_{U\oplus W}(\mathbb{V})$. Further, we find…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We establish existence and uniqueness of compact graphs of constant mean curvature in MxR over bounded multiply connected domains of Mx{0} with boundary lying in two parallel horizontal slices of MxR
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…
Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
We express the discrete Ricci curvature of a graph as the minimal eigenvalue of a family of matrices, one for each vertex of a graph whose entries depend on the local adjaciency structure of the graph. Using this method we compute or bound…
In this paper, we define several measures induced by a finite directed graph. The study themselves is interesting ont only in the noncommutative probability point of view but also in the algebraic structure point of view, since to define…
Let G = (V, p, $\mu$) be a (finite or infinite) weighted graph with bounded geometry. Assuming that G satisfies the classical curvaturedimension condition of Bakry-Emery CD(K, n) with K $\ge$ 0 (for the usual Laplacian), we prove that the…