Related papers: Periodic orbit theory and spectral statistics for …
Analytic methods to investigate periodic orbits in galactic potentials. To evaluate the quality of the approximation of periodic orbits in the logarithmic potential constructed using perturbation theory based on Hamiltonian normal forms.…
We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…
Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$ the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed $k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution (the…
We investigate the "stratified Ehrhart ring theory" for periodic graphs, which gives an algorithm for determining the growth sequences of periodic graphs. The growth sequence $(s_{\Gamma, x_0, i})_{i \ge 0}$ is defined for a graph $\Gamma$…
We compute the dispersion laws of chaotic periodic systems using the semiclassical periodic orbit theory to approximate the trace of the powers of the evolution operator. Aside from the usual real trajectories, we also include complex…
We investigate the influence of diffraction on the statistics of energy levels in quantum systems with a chaotic classical limit. By applying the geometrical theory of diffraction we show that diffraction on singularities of the potential…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
Statistical field theory methods have been very successful with a number of random graph and random matrix problems, but it is challenging to apply these methods to graphs with prescribed degree sequences due to the extensive number of…
We consider stochastic differential equations, obtained by adding weak Gaussian white noise to ordinary differential equations admitting $N$ asymptotically stable periodic orbits. We construct a discrete-time, continuous-space Markov chain,…
For certain types of quantum graphs we show that the random-matrix form factor can be recovered to at least third order in the scaled time $\tau$ from periodic-orbit theory. We consider the contributions from pairs of periodic orbits…
It is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, we propose a method to obtain all the spectrum, and also the…
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the…
We present experimental and numerical results for the long-range fluctuation properties in the spectra of quantum graphs with chaotic classical dynamics and preserved time-reversal invariance. Such systems are generally believed to provide…
The problems of computing eccentricity, radius, and diameter are fundamental to graph theory. These parameters are intrinsically defined based on the distance metric of the graph. In this work, we propose quantum algorithms for the diameter…
One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and Goldstone [Phys. Rev. A 70, 022314 (2004)], finds a marked…
Transition State Theory forms the basis of computing reaction rates in chemical and other systems. Recently it has been shown how transition state theory can rigorously be realized in phase space using an explicit algorithm. The…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
The energy levels of a quantum graph with time reversal symmetry and unidirectional classical dynamics are doubly degenerate and obey the spectral statistics of the Gaussian Unitary Ensemble. These degeneracies, however, are lifted when the…
We derive an explicit formula for the fundamental solution $K_{T_{q+1}}(x,x_{0};t)$ to the discrete-time diffusion equation on the $(q+1)$-regular tree $T_{q+1}$ in terms of the discrete $I$-Bessel function. We then use the formula to…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…