Related papers: Localization on quantum graphs with random edge le…
The energy level statistics of uniform random graphs are studied, by treating the graphs as random tight-binding lattices. The inherent random geometry of the graphs and their dynamical spatial dimensionality, leads to various quantum…
Design of filters for graph signal processing benefits from knowledge of the spectral decomposition of matrices that encode graphs, such as the adjacency matrix and the Laplacian matrix, used to define the shift operator. For shift matrices…
There are two main notions of a Laplacian operator associated with graphs: discrete graph Laplacians and continuous Laplacians on metric graphs (widely known as quantum graphs). Both objects have a venerable history as they are related to…
Let $G$ be a random graph on the vertex set $\{1,2,..., n\}$ such that edges in $G$ are determined by independent random indicator variables, while the probability $p_{ij}$ for $\{i,j\}$ being an edge in $G$ is not assumed to be equal.…
On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…
Let $\Gamma$ be a locally finite graph, $L$ the normalized Laplacian of $\Gamma$. If $\Gamma$ is uniformy locally finite, i.e. if each vertex has no more than $d$ adjacent vertices, then the matrix of $L$ (with respect to the standard…
Using one-dimensional tight-binding lattices and an analytical expression based on the Green's matrix, we show that anomalous minimum of the localization length near an isolated flat band, previously found for evanescent waves in a…
In this article we consider the spectrum of a Laplacian matrix, also known as the Markov matrix, under the independence assumption. We assume that the entries have a variance profile. Motivated by recent works on generalized Wigner matrices…
We consider multi-dimensional Schr\"odinger operators with a weak random perturbation distributed in the cells of some periodic lattice. In every cell the perturbation is described by the translate of a fixed abstract operator depending on…
Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…
We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation…
We investigate spectral properties of Kirchhoff Laplacians on radially symmetric antitrees. This class of metric graphs enjoys a rich group of symmetries, which enables us to obtain a decomposition of the corresponding Laplacian into the…
We theoretically investigate the effects of atomic defect related short-range disorders and electron-electron interactions on Anderson type localization and the magnetic properties of hexagonal armchair graphene quantum dots using an…
We construct quantum models of two particles on a compact metric graph with singular two-particle interactions. The Hamiltonians are self-adjoint realisations of Laplacians acting on functions defined on pairs of edges in such a way that…
In this paper we consider Schr\"{o}dinger operators on $M \times \mathbb{Z}^{d_2}$, with $M=\{M_{1}, \ldots, M_{2}\}^{d_1}$ (`quantum wave guides') with a `$\Gamma$-trimmed' random potential, namely a potential which vanishes outside a…
We consider a metric graph consisting of two edges, one of which has length $\varepsilon$ which we send to zero. On this graph we study the resolvent and spectrum of the Laplacian subject to a general vertex condition at the connecting…
We determine the joint distribution of the lengths of, and angles between, the N shortest lattice vectors in a random n-dimensional lattice as n tends to infinity. Moreover we interpret the result in terms of eigenvalues and eigenfunctions…
We extend the latent position random graph model to the line graph of a random graph, which is formed by creating a vertex for each edge in the original random graph, and connecting each pair of edges incident to a common vertex in the…
This is a slightly enlarged and corrected version of a contribution to the Oberwolfach Reports 3(1):511-552, 2006. We summarise some results on spectral properties of Laplacians on percolation graphs and more general Anderson-percolation…
The spectral gap for Laplace operators on metric graphs is investigated in relation to graph's connectivity, in particular what happens if an edge is added to (or deleted from) a graph. It is shown that in contrast to discrete graphs…