Related papers: The Feller Property for Graphs
In this paper we study the domain of stable processes, stable-like processes and more general pseudo- and integro-differential operators which naturally arise both in analysis and as infinitesimal generators of L\'evy- and L\'evy-type…
The Euler characteristic $\chi =|V|-|E|$ and the total length $\mathcal{L}$ are the most important topological and geometrical characteristics of a metric graph. Here, $|V|$ and $|E|$ denote the number of vertices and edges of a graph. The…
We study feature propagation on graph, an inference process involved in graph representation learning tasks. It's to spread the features over the whole graph to the $t$-th orders, thus to expand the end's features. The process has been…
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 initiates the study of fractional eternal domination in graphs, a natural relaxation of the well-studied eternal domination problem. We study the connections to flows and linear programming in order to obtain results on the…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
It is proved that the C*-algebra of a graph is residually finite dimensional (RFD) if and only if the graph has no infinite receiver, no cycle with an exit, no infinite ackward chain and from each vertex, there is a finite path to a sink or…
The dimer model is an exactly solvable model of planar statistical mechanics. In its critical phase, various aspects of its scaling limit are known to be described by the Gaussian free field. For periodic graphs, criticality is an algebraic…
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…
We establish a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. At the center of this framework lies the concept of a $\leqslant$-parametric graph:…
We study Bakry-\'Emery curvature-dimension inequalities for non-local operators on the one-dimensional lattice and prove that operators with finite second moment have finite dimension. Moreover, we show that a class of operators related to…
In this note we study the generation of $C_0$-semigroups by first order differential operators on $\mathrm{L}^p (\mathbb{R}_+,\mathbb{C}^{\ell})\times \mathrm{L}^p ([0,1],\mathbb{C}^{m})$ with general boundary conditions. In many cases we…
We prove that every sofic approximation of a property (T) group is approximately isomorphic to one having geometric property (T), and more generally, a box space of graphs which has boundary geometric property (T) is approximately…
Using functions from electrical networks (graphs with resistors assigned to edges), we prove existence (with explicit formulas) of a canonical Parseval frame in the energy Hilbert space $\mathscr{H}_{E}$ of a prescribed infinite (or finite)…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…
We consider the possibility of adding a Grassmann-odd function \nu to the odd Laplacian. Requiring the total \Delta operator to be nilpotent leads to a differential condition for \nu, which is integrable. It turns out that the odd function…
In this note we define L-functions of finite graphs and study the particular case of finite cycles in the spirit of a previous paper that studied spectral zeta functions of graphs. The main result is a suggestive equivalence between an…
We study semilinear elliptic inequalities with a potential on infinite graphs. Given a distance on the graph, we assume an upper bound on its Laplacian, and a growth condition on a suitable weighted volume of balls. Under such hypotheses,…
For a self--adjoint Laplace operator on a finite, not necessarily compact, metric graph lower and upper bounds on each of the negative eigenvalues are derived. For compact finite metric graphs Poincar\'{e} type inequalities are given.
Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…