相关论文: On multiplicity of spectrum for Anderson type oper…

We analyze the singular spectrum of selfadjoint operators which arise from pasting a finite number of boundary relations with a standard interface condition. A model example for this situation is a Schroedinger operator on a star-shaped…

We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…

In this paper we consider two classes of random Hamiltonians on $L^2(\RR^d)$ one that imitates the lattice case and the other a Schr\"odinger operator with non-decaying, non-sparse potential both of which exhibit a.c. spectrum. In the…

We will consider cross products of finite graphs with a class of trees that have arbitrarily but finitely long line segments, such as the Fibonacci tree. Such cross products are called tree-strips. We prove that for small disorder random…

The problem of approximating the discrete spectra of families of self-adjoint operators that are merely strongly continuous is addressed. It is well-known that the spectrum need not vary continuously (as a set) under strong perturbations.…

It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…

In this paper we introduce and study generally non-self-adjoint realizations of the Dirac operator on an arbitrary finite metric graph. Employing the robust boundary triple framework, we derive, in particular, a variant of the Birman…

We study the spectral multiplicity of Jacobi operators on star-like graphs with $m$ branches. Recently, it was established that the multiplicity of the singular continuous spectrum is at most $m$. Building on these developments and using…

Given an infinite graph $G$ on countably many vertices, and a closed, infinite set $\Lambda$ of real numbers, we prove the existence of an unbounded self-adjoint operator whose graph is $G$ and whose spectrum is $\Lambda$.

We discuss ways in which momentum operators can be introduced on an oriented metric graph. A necessary condition appears to the balanced property, or a matching between the numbers of incoming and outgoing edges; we show that a graph…

We investigate the effect of non-symmetric relatively bounded perturbations on the spectrum of self-adjoint operators. In particular, we establish stability theorems for one or infinitely many spectral gaps along with corresponding…

The authors study the spectral theory of self-adjoint operators that are subject to certain types of perturbations. An iterative introduction of infinitely many randomly coupled rank-one perturbations is one of our settings. Spectral…

In this paper, we prove that every diagonal operator on a Hilbert space of which is of multiplicity one and has perfect spectrum admits a rank one perturbation without eigenvalues. This answers a question of Ionascu.

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…

We describe the spectral theory of the adjacency operator of a graph which is isomorphic to homogeneous trees at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the…

We study the spectrum of a periodic self-adjoint operator on the axis perturbed by a small localized nonself-adjoint operator. It is shown that the continuous spectrum is independent of the perturbation, the residual spectrum is empty, and…

We study random k-lifts of large, but otherwise arbitrary graphs G. We prove that, with high probability, all eigenvalues of the adjacency matrix of the lift that are not eigenvalues of G are of the order (D ln (kn))^{1/2}, where D is the…

Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the…

A celebrated result of Otter says the number of distinct unlabelled spanning trees in $K_n$ is $\alpha^n$ up to subexponential factors for an absolute constant $\alpha>0$. In this note, we prove that for every $0<\varepsilon<\alpha$, there…

We prove a number of results to the effect that generic quantum graphs (defined via operator systems as in the work of Duan-Severini-Winter / Weaver) have few symmetries: for a Zariski-dense open set of tuples $(X_1,\cdots,X_d)$ of…