相关论文: Spectral analysis for adjacency operators on graph…
In the model suggested by Smilansky one studies an operator describing the interaction between a quantum graph and a system of $K$ one-dimensional oscillators attached at several different points in the graph. The present paper is the first…
We investigate when a complete graph $K_n$ with some edges deleted is determined by its adjacency spectrum. It is shown to be the case if the deleted edges form a matching, a complete graph $K_m$ provided $m \leq n-2$, or a complete…
We study the spectrum of a system of second order differential operator perturbed by a non-selfadjoint matrix valued potential. We prove that eigenvalues of the perturbed operator are located near the edges of the spectrum of the…
Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…
In this paper, we investigate spectral properties of the adjacency tensor, Laplacian tensor and signless Laplacian tensor of general hypergraphs (including uniform and non-uniform hypergraphs). We obtain some bounds for the spectral radius…
We consider a non-relativistic quantum particle interacting with a singular potential supported by two parallel straight lines in the plane. We locate the essential spectrum under the hypothesis that the interaction asymptotically…
Complex Hadamard matrices are biunitaries for spin model commuting squares. The corresponding subfactor standard invariant can be identified with the $1$-eigenspace of the angle operator defined by Jones. We identify the angle operator as…
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian…
Connectivity is a fundamental property of quantum graphs, previously studied in the operator system model for matrix quantum graphs and via graph homomorphisms in the quantum adjacency matrix model. In this paper, we develop an algebraic…
Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
Previously, the existence of ground state solutions of a family of systems of Klein-Gordon equations has been widely studied. In this article, we will study the linearized operator at the ground state and give a complete description of the…
The theory of random sets is demonstrated to prove useful for the theory of random operators. A random operator is here defined by requiring the graph to be a random set. It is proved that the spectrum and the set of eigenvalues of random…
We develop the method of similar operators to study the spectral properties of unbounded perturbed linear operators that can be represented by matrices of various kinds. The class of operators under consideration includes various…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
Not necessarily self-adjoint quantum graphs -- differential operators on metric graphs -- are considered. Assume in addition that the underlying metric graph possesses an automorphism (symmetry) $ \mathcal P $. If the differential operator…
A family $A_\alpha$ of differential operators depending on a real parameter $\alpha\ge 0$ is considered. This family was suggested by Smilansky as a model of an irreversible quantum system. We find the absolutely continuous spectrum…
In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a…
We study the spectral properties of ergodic Schr\"{o}dinger operators that are associated to a certain family of non-primitive substitutions on a binary alphabet. The corresponding subshifts provide examples of dynamical systems that go…
In the model suggested by Smilansky one studies an operator describing the interaction between a quantum graph and a system of K one-dimensional oscillators attached at different points of the graph. This paper is a continuation of our…