Related papers: Inverse problems in quantum graphs and accidental …
Dimer models (also known as brane tilings) are special bipartite graphs on a torus $\mathbb{T}^2$. They encode the structure of the 4d $\mathcal{N} = 1$ worldvolume theories of D3 branes probing toric affine Calabi-Yau singularities.…
We consider a class of simple quasi one-dimensional classically non-integrable systems which capture the essence of the periodic orbit structure of general hyperbolic nonintegrable dynamical systems. Their behavior is simple enough to allow…
We consider a variable order differential operator on a graph with a cycle. We study the inverse spectral problem for this operator by the system of spectra. The main results of the paper are the uniqueness theorem and the constructive…
We study the statistical properties of the scattering matrix associated with generic quantum graphs. The scattering matrix is the quantum analogue of the classical evolution operator on the graph. For the energy-averaged spectral form…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property (SSP) is an important tool for this problem. This note…
We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…
We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported, we show that the S-matrix for all energies in any open set in the continuous…
Quantum adiabatic algorithms are commonly analyzed through local spectral properties of an interpolating Hamiltonian, most notably the minimum energy gap. While this perspective captures an important constraint on adiabatic runtimes, it…
We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the S-matrix for all energies in any given open set…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
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…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
We prove that the spectrum of an individual chaotic quantum graph shows universal spectral correlations, as predicted by random--matrix theory. The stability of these correlations with regard to non--universal corrections is analyzed in…
Spectral problems are considered generated by the Sturm-Liouville equation on connected simple equilateral graphs with the Neumann and Dirichlet boundary conditions at the pendant vertices and continuity and Kirchhoff's conditions at the…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…