相关论文: Spectral statistics for scaling quantum graphs
We study multifractal properties of wave functions for a one-parameter family of quantum maps displaying the whole range of spectral statistics intermediate between integrable and chaotic statistics. We perform extensive numerical…
In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…
Determinantal ideals of graphs generalize, among others, the spectrum and the Smith normal form (SNF) of integer matrices associated to graphs. In this work we investigate the relationship of the spectrum and the SNF with the determinantal…
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…
The connection between the scaling function, directly extracted from the analysis of electron scattering data, and the nuclear spectral function or nuclear momentum density is investigated at depth. The dependence of the scaling function on…
We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.
A numerical approach to the problem of wave scattering by many small particles is developed under the assumptions k<<1, d>>a, where a is the size of the particles and d is the distance between the neighboring particles. On the wavelength…
This paper presents a concise tutorial on spectral clustering for broad spectrum graphs which include unipartite (undirected) graph, bipartite graph, and directed graph. We show how to transform bipartite graph and directed graph into…
We use multi-time correlation functions of quantum systems to construct random variables with statistical properties that reflect the degree of complexity of the underlying quantum dynamics.
This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…
Fractals define a new and interesting realm for a discussion of basic phenomena in quantum field theory and statistical mechanics. This interest results from specific properties of fractals, e.g., their dilatation symmetry and the…
The change of the effective dimension of spacetime with the probed scale is a universal phenomenon shared by independent models of quantum gravity. Using tools of probability theory and multifractal geometry, we show how dimensional flow is…
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.
In this paper, we consider a sequence of open quantum graphs, with uniformly bounded data, and we are interested in the asymptotic distribution of their scattering resonances. Supposing that the number of leads in our quantum graphs is…
In graph signal processing, the graph adjacency matrix or the graph Laplacian commonly define the shift operator. The spectral decomposition of the shift operator plays an important role in that the eigenvalues represent frequencies and the…
In this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on $n$ letters. We prove that every partition of the number $n$ gives…
A statistical analysis of the prime numbers indicates possible traces of quantum chaos. We have computed the nearest neighbor spacing distribution, number variance, skewness, and excess for sequences of the first N primes for various values…
Within random matrix theory for quantum dots, both the dot's one-particle eigenlevels and the dot-lead couplings are statistically distributed. While the effect of the latter on the conductance is obvious and has been taken into account in…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
We study quantum maps displaying spectral statistics intermediate between Poisson and Wigner-Dyson. It is shown that they can be simulated on a quantum computer with a small number of gates, and efficiently yield information about fidelity…