Related papers: Can One Hear the Shape of a Graph?
We propose GLAudio: Graph Learning on Audio representation of the node features and the connectivity structure. This novel architecture propagates the node features through the graph network according to the discrete wave equation and then…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
For a time dependent Schr\"odinger equation, the scattering map is the map sending the asymptotic profile of solution as $t\to-\infty$ to its asymptotic profile as $t\to+\infty$. In this paper we show that, for certain class of metrics, the…
We analyze spectral properties of a quantum graph in the form of a ring chain with a $\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the…
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry,…
Symplectic vector-valued scalar product is constructed on the spaces of solutions of the real discrete Shrodinger equation with fixed value of the spectral parameter on graphs. It takes values in the first homology group of the graph. This…
In this paper we study the noncompact star-type graph with perturbed radial Schrodinger equation on each ray and the matching conditions of some special form at the vertex. The results include the uniqueness theorem and constructive…
We consider magnetic Schroedinger operators on quantum graphs with identical edges. The spectral problem for the quantum graph is reduced to the discrete magnetic Laplacian on the underlying combinatorial graph and a certain Hill operator.…
We consider the inverse scattering problems for two types of Schr\"odinger operators on locally perturbed periodic lattices. For the discrete Hamiltonian, the knowledge of the S-matrix for all energies determines the graph structure and the…
The spectral theory of quantum graphs is related via an exact trace formula with the spectrum of the lengths of periodic orbits (cycles) on the graphs. The latter is a degenerate spectrum, and understanding its structure (i.e.,finding out…
For a finite graph, a spectral curve is constructed as the zero set of a two-variate polynomial with integer coefficients coming from p-adic diffusion on the graph. It is shown that certain spectral curves can distinguish non-isomorphic…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
We consider Schr\"odinger operators with periodic potentials on periodic discrete graphs. Their spectrum consists of a finite number of bands. We obtain two-sided estimates of the total bandwidth for the Schr\"odinger operators in terms of…
We study spectra of alloy-type random Schr\"odinger operators on metric graphs. For finite edge subsets of general graphs we prove a Wegner estimate which is linear in the volume (i.e. the number of edges) and the length of the considered…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
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 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…
We consider an inverse spectral problem on a quantum graph associated with the square lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the Dirichlet-to-Neumann map for a boundary value…
The Frequency Domain Reflectometry (FDR) is studied as a powerful tool to detect hard or soft faults in star-shaped networks of nonuniform lossless transmission lines. Processing the FDR measurements leads to solve an inverse scattering…