Related papers: Exterior-Interior Duality for Discrete Graphs

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…

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 graph $G$ is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to $G$. van Dam and Haemers (2003) conjectured that almost all graphs have this property, but that is…

The abstract elliptic and parabolic equations on exterior domain are considered. The equations have top-order variable coefficients. The separability properties of boundary value problems for elliptic equation and well-posedness of the…

We introduce the notion of discrete cusp for a weighted graph. In this context, we provethat the form-domain of the magnetic Laplacian and that of thenon-magnetic Laplacian can be different. We establish the emptiness of the essential…

The 2-matrix model has been introduced to study Ising model on random surfaces. Since then, the link between matrix models and combinatorics of discrete surfaces has strongly tightened. This manuscript aims to investigate these deep links…

We present an analog to classic potential theory on weighted graphs. With nodes partitioned into exterior, boundary and interior nodes and an appropriate decomposition of the Laplacian, we define discrete analogues to the trace operators,…

We study theoretically the spatial correlations between the intensities measured at the input and output planes of a disordered scattering medium. We show that at large optical thicknesses, a long-range spatial correlation persists and…

We present a detailed study of the scattering system given by the Neumann Laplacian on the discrete half-space perturbed by a periodic potential at the boundary. We derive asymptotic resolvent expansions at thresholds and eigenvalues, we…

In this article we show the duality between tensor networks and undirected graphical models with discrete variables. We study tensor networks on hypergraphs, which we call tensor hypernetworks. We show that the tensor hypernetwork on a…

We study the orbital effect of a strong magnetic field parallel to the layers on the energy spectrum of the Bernal-stacked graphene bilayer and multilayers, including graphite. We consider the minimal model with the electron tunneling…

We consider spectral methods that uncover hidden structures in directed networks. We establish and exploit connections between node reordering via (a) minimizing an objective function and (b) maximizing the likelihood of a random graph…

For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…

We study the spectral determinant of the Laplacian on finite graphs characterized by their number of vertices V and of bonds B. We present a path integral derivation which leads to two equivalent expressions of the spectral determinant of…

We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect the…

We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.

We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…

This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…

The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…

The nodal set of a Laplacian eigenfunction forms a partition of the underlying manifold or graph. Another natural partition is based on the gradient vector field of the eigenfunction (on a manifold) or on the extremal points of the…