Related papers: Quantum ergodicity on graphs
In this paper, we study random features manifested in components of energy eigenfunctions of quantum chaotic systems, given in the basis of unperturbed, integrable systems. Based on semiclassical analysis, particularly on Berry's…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…
We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…
The statistics of the nodal lines and nodal domains of the eigenfunctions of quantum billiards have recently been observed to be fingerprints of the chaoticity of the underlying classical motion by Blum et al. (Phys. Rev. Lett., Vol. 88…
We calculate statistical properties of the eigenfunctions of two quantum systems that exhibit intermediate spectral statistics: star graphs and Seba billiards. First, we show that these eigenfunctions are not quantum ergodic, and calculate…
We present a survey of ergodic theorems for actions of algebraic and arithmetic groups recently established by the authors, as well as some of their applications. Our approach is based on spectral methods employing the unitary…
In this paper, we prove the equidistribution property of high-frequency eigensections of a certain series of unitary flat bundles, using the mixture of semiclassical and geometric quantizations.
We consider the real eigenfunctions of the Schr\"odinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds $B$. For well connected graphs, with…
We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…
One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of quantum-chaotic billiards and maps in the semi-classical limit display critical percolation. Here we extend these studies to the level sets…
One of the first steps in applications of statistical network analysis is frequently to produce summary charts of important features of the network. Many of these features take the form of sequences of graph statistics counting the number…
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…
A one-parameter random matrix model is proposed for describing the statistics of the local amplitudes and phases of electron eigenfunctions in a mesoscopic quantum dot in an arbitrary magnetic field. Comparison of the statistics obtained…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
Quantum theory has shown its superiority in enhancing machine learning. However, facilitating quantum theory to enhance graph learning is in its infancy. This survey investigates the current advances in quantum graph learning (QGL) from…
Under suitable hypotheses, a symplectic map can be quantized as a sequence of unitary operators acting on the $N$th powers of a positive line bundle over a K\"{a}hler manifold. We show that if the symplectic map has polynomial decay of…
Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…
The validity of the ergodic hypothesis in quantum systems can be rephrased in the form of the eigenstate thermalisation hypothesis (ETH), a set of statistical properties for the matrix elements of local observables in energy eigenstates,…
We study the $k$-core of a random (multi)graph on $n$ vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50--62] we used properties of empirical distributions of independent random variables…