Related papers: Analyticity of the spectrum and Dirichlet-to-Neuma…
We describe some basic tools in the spectral theory of Schr\"odinger operator on metric graphs (also known as "quantum graph") by studying in detail some basic examples. The exposition is kept as elementary and accessible as possible. In…
We study the question to what extent spectral information of a Schr\"odinger operator on a finite, compact metric graph subject to standard or $\delta$-type matching conditions can be recovered from a corresponding Titchmarsh-Weyl function…
We establish operator norm bounds for bipartite tensor sums of self-adjoint contractions. The inequalities generalize the analytic structure underlying the Tsirelson and CHSH bounds, giving dimension-free estimates expressed through…
We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of $\mathbb{C}^n$ in terms of the spectrum of both the unperturbed \& perturbed matrices, as well…
The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…
The magnetic Dirichlet-to-Neumann map encodes the voltage-to-current measurements under the influence of a magnetic field. In the case of surfaces, we provide precise spectral asymptotics expansion (up to arbitrary polynomial power) for the…
There is a connection between *-representations of algebras associated with graphs and the problem about the spectrum of a sum of Hermitian operators (spectral problem). For algebras associated with extended Dynkin graphs we give an…
As an outgrowth of our investigation of non-regular spaces within the context of quantum gravity and non-commutative geometry, we develop a graph Hilbert space framework on arbitrary (infinite) graphs and use it to study spectral properties…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…
Let $(G_\epsilon)_{\epsilon>0}$ be a family of '$\epsilon$-thin' Riemannian manifolds modeled on a finite metric graph $G$, for example, the $\epsilon$-neighborhood of an embedding of $G$ in some Euclidean space with straight edges. We…
We study a quantum Hamiltonian that is given by the (negative) Laplacian and an infinite chain of $\delta$-like potentials with strength $\kappa>0$ on the half line $\rz_{\geq0}$ and which is equivalent to a one-parameter family of…
In the present article we will give a new proof of the ground state asymptotics of the Dirichlet Laplacian with a Neumann window acting on functions which are defined on a two-dimensional infinite strip or a three-dimensional infinite…
The present work describes some extensions of an approach, originally developed by V.V. Yatsyk and the author, for the theoretical and numerical analysis of scattering and radiation effects on infinite plates with cubically polarized…
Bound states of the Hamiltonian describing a quantum particle living on three dimensional straight strip of width $d$ are investigated. We impose the Neumann boundary condition on the two concentric windows of the radii $a$ and $ b$ located…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural…
In the past years, many quantum algorithms have been proposed to tackle hard combinatorial problems. In particular, the Maximum Independent Set (MIS) is a known NP-hard problem that can be naturally encoded in Rydberg atom arrays. By…
Two methods for computing bound states of the Helmholtz equation in a finite domain are presented. The methods are formulated in terms of the Dirichlet-to-Neumann (DtN) and Neumann-to-Dirichlet (NtD) surface integral operators. They are…
In graph signal processing, many studies assume that the underlying network is undirected. Although the digraph model is rarely adopted, it is more appropriate for many applications, especially for real world networks. In this paper, we…