Related papers: Spectral statistics of preferred orientation quant…
Consider a quantum graph consisting of a ring with two attached edges, and assume Kirchhoff-Neumann conditions hold at the internal vertices. Associated to this graph is a Schr\"{o}dinger type operator $L=-\Delta +q(x)$ with Dirichlet…
We numerically analyze the random matrix ensembles of real-symmetric matrices with column/row constraints for many system conditions e.g. disorder type, matrix-size and basis-connectivity. The results reveal a rich behavior hidden beneath…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
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…
We present a spectral-theoretic approach to time-average statistical mechanics for general, non-equilibrium initial conditions. We consider the statistics of bounded, local additive functionals of reversible as well as irreversible ergodic…
In this paper, we investigate the Moore-Penrose inversion of a simple connected graph. We analyze qualitative, statistical, and extreme properties of spectral indices of signable pseudo-invertible graphs. We introduce and analyze a wide…
This paper discusses a general method for spectral type theorems using metric spaces instead of vector spaces. Advantages of this approach are that it applies to genuinely non-linear situations and also to random versions. Metric analogs of…
We study the spectrum of the join of several circulant matrices. We apply our results to compute explicitly the spectrum of certain graphs obtained by joining several circulant graphs.
Signed graphs are graphs whose edges get a sign $+1$ or $-1$ (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much…
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods…
We demonstrate how the inverse scattering problem of a quantum star graph can be solved by means of diagonalization of Hermitian unitary matrix when the vertex coupling is of the scale invariant (or F\"ul\H{o}p-Tsutsui) form. This enables…
The quantum baker's map is the quantization of a simple classically chaotic system, and has many generic features that have been studied over the last few years. While there exists a semiclassical theory of this map, a more rigorous study…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
In many situations, the statistical properties of wave systems with chaotic classical limits are well-described by random matrix theory. However, applications of random matrix theory to scattering problems require introduction of system…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
We numerically analyze the statistical properties of complex system with conditions subjecting the matrix elements to a set of specific constraints besides symmetry, resulting in various structures in their matrix representation. Our…
We study spectral statistics in spatially extended chaotic quantum many-body systems, using simple lattice Floquet models without time-reversal symmetry. Computing the spectral form factor $K(t)$ analytically and numerically, we show that…
In spite of their evident logical character, particle statistics symmetries are not among the inherently quantum features exploited in quantum computation. A difficulty may be that, being a constant of motion of a unitary evolution, a…
Spectral statistics of quantum systems have been studied in detail using the nearest neighbour level spacings, which for generic chaotic systems follows random matrix theory predictions. In this work, the probability density of the closest…
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…