Related papers: Localization on quantum graphs with random edge le…
We show that the (normalized) symmetric Laplacian of a simple graph can be obtained from the partial trace over a pure bipartite quantum state that resides in a bipartite Hilbert space (one part corresponding to the vertices, the other…
Generative models for graphs have been typically committed to strong prior assumptions concerning the form of the modeled distributions. Moreover, the vast majority of currently available models are either only suitable for characterizing…
Disorder plays a crucial role in many systems particularly in solid state physics. However, the disorder in a particular system can usually not be chosen or controlled. We show that the unique control available for ultracold atomic gases…
The energy level spacing distribution of a tight-binding hamiltonian is monitored across the mobility edge for a fixed disorder strength. Any mixing of extended and localized levels is avoided in the configurational averages, thus…
We study stochastic graph optimization problems in a novel distributed setting. As in the standard centralized setting, a random subgraph $G^*$ of a known base graph $G$ is realized by including each edge $e$ independently with a known…
The spectral landscape and the transport property of a translationally invariant network with side-coupled quantum dots are demonstrated within the tight-binding framework. For periodic environment band structure is demonstrated…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…
This survey is two-fold. We first report new progress on the spectral extremal results on the Tur\'{a}n type problems in graph theory. More precisely, we shall summarize the spectral Tur\'{a}n function in terms of the adjacency spectral…
We prove a quantum-ergodicity theorem on large graphs, for eigenfunctions of Schr\"odinger operators in a very general setting. We consider a sequence of finite graphs endowed with discrete Schr\"odinger operators, assumed to have a local…
Random pure states of multi-partite quantum systems, associated with arbitrary graphs, are investigated. Each vertex of the graph represents a generic interaction between subsystems, described by a random unitary matrix distributed…
Adapting a method developed for the study of quantum chaos on {\it quantum (metric)} graphs \cite {KS}, spectral $\zeta$ functions and trace formulae for {\it discrete} Laplacians on graphs are derived. This is achieved by expressing the…
On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…
In this work we analytically explain the origin of the mobility edge in the partially disordered random regular graphs of degree d, i.e., with a fraction $\beta$ of the sites being disordered, while the rest remain clean. It is shown that…
The statistical properties of the spectrum of the staggered Dirac operator in an SU(2) lattice gauge theory are analyzed both in the bulk of the spectrum and at the spectrum edge. Two commonly used statistics, the number variance and the…
Consider a quantum particle trapped between a curved layer of constant width built over a complete, non-compact, $\mathcal C^2$ smooth surface embedded in $\mathbb{R}^3$. We assume that the surface is asymptotically flat in the sense that…
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…
We address the properties of continuous-time quantum walks with Hamiltonians of the form $\mathcal{H}= L + \lambda L^2$, being $L$ the Laplacian matrix of the underlying graph and being the perturbation $\lambda L^2$ motivated by its…
The Laplacian eigenvalues of a network play an important role in the analysis of many structural and dynamical network problems. In this paper, we study the relationship between the eigenvalue spectrum of the normalized Laplacian matrix and…
In this paper we study random perturbations of first order elliptic operators with periodic potentials. We are mostly interested in Hamiltonians modeling graphene antidot lattices with impurities. The unperturbed operator $H_0 := D_S + V_0$…