Related papers: Distinguishing co-spectral quantum graphs by scatt…
Quantum graphs were introduced to model free electrons in organic molecules using a self-adjoint Hamiltonian on a network of intervals. A second graph quantization describes wave propagation on a graph by specifying scattering matrices at…
Switching is an operation on a graph that does not change the spectrum of the adjacency matrix, thus producing cospectral graphs. An important activity in the field of spectral graph theory is the characterization of graphs by their…
Construction of graphs with equal eigenvalues (co-spectral graphs) is an interesting problem in spectral graph theory. Seidel switching is a well-known method for generating co-spectral graphs. From a matrix theoretic point of view, Seidel…
We derive a counting formula for the eigenvalues of Schr\"odinger operators with self-adjoint boundary conditions on quantum star graphs. More specifically, we develop techniques using Evans functions to reduce full quantum graph eigenvalue…
This work deals with the average scattering entropy of quantum graphs. We explore this concept in several distinct scenarios that involve periodic, aperiodic and random distribution of vertices of distinct degrees. In particular, we compare…
The main objective of this paper is to systematically develop a spectral and scattering theory for selfadjoint Schr\"odinger operators with $\delta$-interactions supported on closed curves in $\mathbb R^3$. We provide bounds for the number…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
We consider a special scattering experiment with n particles in $\mathbb{R}^{n-3,1}$. The scattering equations in this set-up become the saddle-point equations of a Penner-like matrix model, where in the large $n$ limit, the spectral curve…
The graph isomorphism problem is a main problem which has numerous applications in different fields. Thus, finding an efficient and easy to implement method to discriminate non-isomorphic graphs is valuable. In this paper, a new method is…
We study the problem of minimizing or maximizing the fundamental spectral gap of Schr\"odinger operators on metric graphs with either a convex potential or a ``single-well'' potential on an appropriate specified subset. (In the case of…
We investigate whether it is typical for a sparse graph to be uniquely characterized by its adjacency spectrum up to isomorphism. Our first result shows that the giant component of an Erd\H{o}s-R\'enyi graph is cospectral when the average…
Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…
We study the point spectrum of a periodic quantum tree equipped with a Schr\"odinger type differential operator with delta-type vertex conditions, using subsets of the compact graph that generates the tree. We prove analogs of existing…
We discuss scattering from pairs of isospectral quantum graphs constructed using the method described in [1, 2]. It was shown in [3] that scattering matrices of such graphs have the same spectrum and polar structure, provided that infinite…
We investigate the equivalence between spectral characteristics of the Laplace operator on a metric graph, and the associated unitary scattering operator. We prove that the statistics of level spacings, and moments of observations in the…
We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…
We study cospectral vertices on finite graphs in relation to the echolocation problem on Riemannian manifolds. First, We prove a computationally simple criterion to determine whether two vertices are cospectral. Then, we use this criterion…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
In this paper we investigate the spectral and the scattering theory of Schr\"odinger operators acting on perturbed periodic discrete graphs. The perturbations considered are of two types: either a multiplication operator by a short-range or…
This work explores the spectra of quantum graphs where the Schr\"odinger operator on the edges is equipped with a potential. The scattering approach, which was originally introduced for the potential free case, is extended to this case and…