Related papers: Momentum operators on graphs
We introduce $\delta$ type vertex conditions for beam operators, the fourth derivative operator, on metric graphs and study the effect of certain geometrical alterations (graph surgery) of the graph on the spectra of beam operators on…
The question of self-adjoint realizations of sign-indefinite second order differential operators is discussed in terms of a model problem. Operators of the type $-\frac{d}{dx} \sgn (x) \frac{d}{dx}$ are generalized to finite, not…
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
In this oaper, we prove some fixed point theorems in metric vector spaces, in which the continuity is not required for the considered mappings to satisfy. We provide some concrete examples to demonstrate these theorems. We also give some…
An edge-colored directed graph is \emph{observable} if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge colors. When the agent is able to determine his…
A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…
A graph operator is a function $\Gamma$ defined on some set of graphs such that whenever two graphs $G$ and $H$ are isomorphic, written $G\simeq H$, then $\Gamma(G)\simeq \Gamma(H)$. For a graph $G$ not in the domain of $\Gamma$, we put…
The main aim of the paper is Fredholm properties of a class of bounded linear operators acting on weighted Lebesgue spaces on an infinite metric graph $\Gamma$ which is periodic with respect to the action of the group ${\mathbb Z}^n$. The…
Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…
Graphons, as limits of graph sequences, provide an operator-theoretic framework for analyzing the asymptotic behavior of graph neural operators. Spectral convergence of sampled graphs to graphons induces convergence of the corresponding…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
We construct embeddings of boundary algebras B into ZF algebras A. Since it is known that these algebras are the relevant ones for the study of quantum integrable systems (with boundaries for B and without for A), this connection allows to…
We compare the spectral properties of two kinds of linear operators characterizing the (classical) geodesic flow and its quantization on connected locally finite graphs without dead ends. The first kind are transfer operators acting on…
We introduce a new definition of topological degree for a meaningful class of operators which need not be continuous. Subsequently, we derive a number of fixed point theorems for such operators. As an application, we deduce a new existence…
We consider selfadjoint operators obtained by pasting a finite number of boundary relations with one-dimensional boundary space. A typical example of such an operator is the Schr\"odinger operator on a star-graph with a finite number of…
Graphs and networks play an important role in modeling and analyzing complex interconnected systems such as transportation networks, integrated circuits, power grids, citation graphs, and biological and artificial neural networks. Graph…
A class A of labelled graphs is bridge-addable if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and u is also in A; the class A is monotone if for all G…
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers certain queries that are specific to the problem under consideration. There has been a lot of research on dynamic algorithms…
There is a well-documented research programme on graph operators which addresses questions such as `Which graphs appear as images of graphs?'; `Which graphs are fixed under the operator?'; `What happens if the operator is iterated?' In this…