Related papers: A trace formula for scattering resonances of unbal…
We consider wave propagation across an infinite waveguide of an arbitrary bounded cross-section, whose interior is blocked by two identical thick barriers with holes. When the holes are small, the waves over a broad range of frequencies are…
We calculate the S-matrix correlation function for chaotic scattering on quantum graphs and show that it agrees with that of random--matrix theory (RMT). We also calculate all higher S-matrix correlation functions in the Ericson regime.…
We solve inverse problems from the D-N map for the quantum graph on a finite domain in a square lattice and that on a hexagonal lattice, as well as inverse scattering problems from the S-matrix for a locally perturbed square lattice and a…
Resonance and decay phenomena are ubiquitous in the quantum world. To understand them in their complexity it is useful to study solvable models in a wide sense, that is, systems which can be treated by analytical means. The present review…
We give an estimate of the quantum variance for $d$-regular graphs quantised with boundary scattering matrices that prohibit back-scattering. For families of graphs that are expanders, with few short cycles, our estimate leads to quantum…
We derive several upper bounds on the spectral gap of the Laplacian with standard or Dirichlet vertex conditions on compact metric graphs. In particular, we obtain estimates based on the length of a shortest cycle (girth), diameter, total…
We consider a one-body spin-less electron spectral problem for a resonance scattering system constructed of a quantum well weakly connected to a noncompact exterior reservoir, where the electron is free. The simplest kind of the resonance…
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.…
We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then…
The spectral fluctuations of complex quantum systems, in appropriate limit, are known to be consistent with that obtained from random matrices. However, this relation between the spectral fluctuations of physical systems and random matrices…
The paper is concerned with the number of open gaps in spectra of periodic quantum graphs. The well-known conjecture by Bethe and Sommerfeld (1933) says that the number of open spectral gaps for a system periodic in more than one direction…
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
A numerical solution to the problem of wave scattering by many small particles is studied under the assumption k<<1, d>>a, where a is the size of the particles and d is the distance between the neighboring particles. Impedance boundary…
A linear scattering problem for which incoming and outgoing waves are restricted to a finite number of radiation channels can be precisely described by a frequency-dependent scattering matrix. The entries of the scattering matrix, as…
1-loop quantum corrections are shown to induce large effects on the refraction index $n$ inside a graphene strip in the presence of an external magnetic field $B$ orthogonal to it. To this purpose, we use the tools of Quantum Field Theory…
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…
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…
We derive a trace formula that expresses the level density of chaotic many-body systems as a smooth term plus a sum over contributions associated to solutions of the nonlinear Schr\"odinger (or Gross-Pitaevski) equation. Our formula applies…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
We demonstrate how resonances in a quantum graph consisting of a compact core and semi-infinite leads can be identified from the eigenvalue behavior of the cut-off system.