Related papers: Can One Hear the Shape of a Graph?
Consider a one-dimensional Schroedinger operator which is a short range perturbation of a finite-gap operator. We give necessary and sufficient conditions on the left, right reflection coefficient such that the difference of the potentials…
We discuss scattering from pairs of isospectral quantum graphs constructed using the method described in [1, 2]. It was shown in [3] that scattering matrices of such graphs have the same spectrum and polar structure, provided that infinite…
We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph. Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…
In this paper, we show that for an $n$-vertex graph $G$ of genus $g$, the edge expansion of $G$ can be determined in time $n^{O(g^2)}$. We show that the same is true for various other similar measures of edge connectivity.
We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
We define the magnetic Schr\"odinger on an infinite graph by the data of a magnetic field, some weights on vertices and some weights on edges . We discuss essential self-adjointness of this operator for graphs of bounded degree. The main…
The stochastic Kronecker Graph model can generate large random graph that closely resembles many real world networks. For example, the output graph has a heavy-tailed degree distribution, has a (low) diameter that effectively remains…
We consider a family of compact manifolds which shrinks with respect to an appropriate parameter to a graph. The main result is that the spectrum of the Laplace-Beltrami operator converges to the spectrum of the (differential) Laplacian on…
We consider the Schr\"odinger operator on zigzag graphs with a periodic potential. The spectrum of this operator consists of an absolutely continuous part (intervals separated by gaps) plus an infinite number of eigenvalues with infinite…
Soliton transport in tube-like networks is studied by solving the nonlinear Schroedinger equation (NLSE) on finite thickness ("fat") graphs. The dependence of the solution and of the reflection at vertices on the graph thickness and on the…
We consider the Schr\"odinger operator on a star shaped graph with $n$ edges joined at a single vertex. We derive an expression for the trace of the difference of the perturbed and unperturbed resolvent in terms of a Wronskian. This leads…
Explicit formulas for the analytic extensions of the scattering matrix and the time delay of a quasi-one-dimensional discrete Schr\"odinger operator with a potential of finite support are derived. This includes a careful analysis of the…
We analyze the scattering sector of the Hamiltonians for both gapless and gapped graphene in the presence of a charge impurity using the 2D Dirac equation, which is applicable in the long wavelength limit. We show that for certain range of…
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…
We determine conditions for the quantisation of graphs using the Dirac operator for both two and four component spinors. According to the Bohigas-Giannoni-Schmit conjecture for such systems with time-reversal symmetry the energy level…
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We…
The main paradigm of smoothed analysis on graphs suggests that for any large graph $G$ in a certain class of graphs, perturbing slightly the edges of $G$ at random (usually adding few random edges to $G$) typically results in a graph having…
We study Schr\"odinger operators on metric and discrete decorated graphs. The values taken by the integrated density of states (IDS) on spectral gaps are called gap labels. A natural question is which gap labels can occur. We answer this…
We introduce a fully coherent spin network amplitude whose expansion generates all SU(2) spin networks associated with a given graph. We then give an explicit evaluation of this amplitude for an arbitrary graph. We show how this coherent…