Related papers: The autocorrelation function for spectral determin…
We consider the Gaussian ensembles of random matrices and describe the normal modes of the eigenvalue spectrum, i.e., the correlated fluctuations of eigenvalues about their most probable values. The associated normal mode spectrum is…
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…
We present a semiclassical calculation of the generalized form factor which characterizes the fluctuations of matrix elements of the quantum operators in the eigenbasis of the Hamiltonian of a chaotic system. Our approach is based on some…
We show that correlation matrices with particular average and variance of the correlation coefficients have a notably restricted spectral structure. Applying geometric methods, we derive lower bounds for the largest eigenvalue and the…
Quantum graphs are an operator space generalization of classical graphs that have emerged in different branches of mathematics including operator theory, non-commutative topology and quantum information theory. In this paper, we obtain…
The spectral form factor of random matrix theory plays a key role in the description of disordered and chaotic quantum systems. While its moments are known to be approximately Gaussian, corrections subleading in the matrix dimension, $D$,…
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 random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…
A derivation of the spectral determinant of the Schr\"odinger operator on a metric graph is presented where the local matching conditions at the vertices are of the general form classified according to the scheme of Kostrykin and Schrader.…
As a discrete analogue of Kac's celebrated question on "hearing the shape of a drum", and towards a practical graph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by their spectrum (of their…
It has been long recognized that the task of semiclassical evaluation of quantum spectra for the classically nonintegrable systems is fundamentally more complex than for the classically integrable ones. Below it is argued that the quantum…
We associate with a matrix over an arbitrary field an infinite family of matrices whose sizes vary from one to infinity; their entries are traces of powers of the original matrix. We explicitly evaluate the determinants of matrices in our…
We study the spectral statistics of quantum (metric) graphs whose vertices are equipped with preferred orientation vertex conditions. When comparing their spectral statistics to those predicted by suitable random matrix theory ensembles,…
We review the ideas of how random matrix theory has to be properly applied to quantum physics; particularly we focus on how the spectrum has to be properly prepared and the random matrix correctly identified before the random matrix and the…
We pick up a solvable ${\cal PT}-$symmetric quantum square well on an interval of $x \in := (-L,L)\mathbb{G}^{(2)}$ (with an $\alpha-$dependent non-Hermiticity given by Robin boundary conditions) and generalize it. In essence, we just…
We consider the quantum site percolation model on graphs with an amenable group action. It consists of a random family of Hamiltonians. Basic spectral properties of these operators are derived: non-randomness of the spectrum and its…
We study a certain class of classical one dimensional piecewise linear maps. For these systems we introduce an infinite family of Markov partitions into equal cells. The symbolic dynamics generated by these systems is described by…
Quantum graphs are a paradigmatic model for quantum chaos as well as for spectral theory. We give a concise didactical introduction to quantum graphs, or Schr\"odinger Hamiltonians on metric graphs, with a focus on results related to…
We use semiclassical methods to evaluate the spectral two-point correlation function of quantum chaotic systems with discrete geometrical symmetries. The energy spectra of these systems can be divided into subspectra that are associated to…
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…