Related papers: Universal Quantum Graphs
Two method for computation of the spectra of certain infinite graphs are suggested. The first one can be viewed as a reversed Gram--Schmidt orthogonalization procedure. It relies heavily on the spectral theory of Jacobi matrices. The second…
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…
A general analytical approach to the statistical description of quantum graph spectra based on the exact periodic orbit expansions of quantum levels is discussed. The exact and approximate expressions obtained in \cite{Anima} for the…
For $N$-coupled generalized time-dependent oscillators, primary invariants and a generalized invariant are found in terms of classical solutions. Exact quantum motions satisfying the Heisenberg equation of motion are also found. For number…
I shall present a proof of universality of the microscopic spectral correlations in Verbaarschot's random matrix models of QCD, to corroborate the beautiful agreement between the predictions from the gaussian model and the numerical data.…
A graph $H$ is ubiquitous if for every graph $G$ that for every natural number $n$ contains $n$ vertex-disjoint $H$-minors contains infinitely many vertex-disjoint $H$-minors. Andreae conjectured that every locally finite graph is…
We define a natural ensemble of trace preserving, completely positive quantum maps and present algorithms to generate them at random. Spectral properties of the superoperator Phi associated with a given quantum map are investigated and a…
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…
To a pair $(A,s)$ consisting of a smooth, cyclic $A_\infty$-algebra $A$ and a splitting $s$ of the Hodge filtration on its Hochschild homology Costello (2005) associates an invariant which conjecturally generalizes the total descendant…
The homogeneous Kuramoto model on a graph $G = (V,E)$ is a network of $|V|$ identical oscillators, one at each vertex, where every oscillator is coupled bidirectionally (with unit strength) to its neighbors in the graph. A graph $G$ is said…
Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices…
We establish, in the spirit of the Lieb-Schultz-Mattis theorem, lower bounds on the spectral degeneracy of quantum systems with higher (Gauge Like) symmetries with rather generic physical boundary conditions in an arbitrary number of…
We consider the dynamics on a quantum graph as the limit of the dynamics generated by a one-particle Hamiltonian in R^2 with a potential having a deep strict minimum on the graph, when the width of the well shrinks to zero. For a generic…
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…
A universal adjacency matrix of a graph $G$ with adjacency matrix $A$ is any matrix of the form $U = \alpha A + \beta I + \gamma J + \delta D$ with $\alpha \neq 0$, where $I$ is the identity matrix, $J$ is the all-ones matrix and $D$ is the…
We address the question as to why, in the semiclassical limit, classically chaotic systems generically exhibit universal quantum spectral statistics coincident with those of Random Matrix Theory. To do so, we use a semiclassical resummation…
Spectral statistics of quantum chaotic systems are governed by random matrix universality. In many cases of interest, time-reversal symmetry selects the Gaussian Orthogonal Ensemble (GOE) as the relevant universality class. In holographic…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…