Related papers: Analysis of Dirichlet forms on graphs
We introduce a class of group endomorphisms -- those of finite combinatorial rank -- exhibiting slow orbit growth. An associated Dirichlet series is used to obtain an exact orbit counting formula, and in the connected case this series is…
We study the Dirichlet problem for functions whose graphs are spacelike hypersurfaces with prescribed curvature in the Minkowski space and we obtain some new interior second order estimates for admissible solutions to the corresponding…
Here we consider a few topics related to Lipschitz classes for functions and curves in metric spaces.
In this paper we characterize all of Cayley graphs on dihedral groups with metric dimension two.
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
We study Laplacians on graphs and networks via regular Dirichlet forms. We give a sufficient geometric condition for essential selfadjointness and explicitly determine the generators of the associated semigroups on all $\ell^p$, $1\leq p <…
Frames and Bessel sequences in Fr\'echet spaces and their duals are defined and studied. Their relation with Schauder frames and representing systems is analyzed. The abstract results presented here, when applied to concrete spaces of…
Generalized (rational) graph contractions in the framework of a dislocated metric space endowed with a directed graph are investigated. Fixed point results for set-contractions are obtained. We also provide some examples to illustrate our…
For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
Let $(X_1,d_1),\dots, (X_N,d_N)$ be metric spaces, where $d_i: X_i \times X_i \rightarrow [0,1]$ is a distance function for $i=1,\dots,N$. Let $\mathcal{X}$ denote the set theoretic product $X_1\times \cdots \times X_N$. Let $\mathcal{G} =…
We define an operation of jets on graphs inspired by the corresponding notion in commutative algebra and algebraic geometry. We examine a few graph theoretic properties and invariants of this construction, including chromatic numbers,…
Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
We study the connectedness and the diameter of orthogonality graphs of upper triangular matrix algebras over arbitrary fields.
Pairs of metrics in a two-dimensional linear vector space are considered, one of which is a Minkowski type metric. Their simultaneous diagonalizability is studied and canonical presentations for them are suggested.
We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integrals over discrete groupoids. From this point of view, basic combinatorial formulas of the theory of Feynman diagrams can be interpreted as…