Related papers: Exterior-Interior Duality for Discrete Graphs
This paper reports the results of extensive numerical studies related to spectral properties of the Laplacian and the scattering matrix for planar domains (called billiards). There is a close connection between eigenvalues of the billiard…
We discuss the connections tying Laplacian matrices to abstract duality and planarity of graphs.
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…
Concerning the Laplace operator with homogeneous Dirichlet boundary conditions, the classical notion of isospectrality assumes that two domains are related when they give rise to the same spectrum. In two dimensions, non isometric,…
In this paper, we introduce the Laplacian and the signless Laplacian for the eccentricity matrix of a connected graph, referred to as the eccentricity Laplacian and the eccentricity signless Laplacian, respectively. We establish the…
We present a theory and applications of discrete exterior calculus on simplicial complexes of arbitrary finite dimension. This can be thought of as calculus on a discrete space. Our theory includes not only discrete differential forms but…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
We consider the scattering theory for the Schr\"odinger operator $-\Dc_x^2+V(x)$ on graphs made of one-dimensional wires connected to external leads. We derive two expressions for the scattering matrix on arbitrary graphs. One involves…
Let $N(X)$ be the Laplacian matrix of a directed graph obtained from the edge adjacency matrix of a graph $X.$ In this work, we study the bipartiteness property of the graph with the help of $N(X).$ We computed the spectrum of the edge…
The main goal of this article is to understand the trace properties of nonlocal minimal graphs in~$\R^3$, i.e. nonlocal minimal surfaces with a graphical structure. We establish that at any boundary points at which the trace from inside…
A spectral approach to building the exterior calculus in manifold learning problems is developed. The spectral approach is shown to converge to the true exterior calculus in the limit of large data. Simultaneously, the spectral approach…
We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…
The generalized tight-binding model, with the exact diagonalization method, is developed to investigate optical properties of graphene in five kinds of external fields. The quite large Hamiltonian matrix is transferred into the band-like…
A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
In this paper we obtain several tight bounds on different types of alliance numbers of a graph: (global) defensive alliance number, global offensive alliance number and global dual alliance number. In particular, we investigate the…
We characterize the spectrum of the Laplacian of graphs composed of one or two finite or infinite chains connected to a complete graph. We show the existence of localized eigenvectors of two types, eigenvectors that vanish exactly outside…
Graphical models have proven to be powerful tools for representing high-dimensional systems of random variables. One example of such a model is the undirected graph, in which lack of an edge represents conditional independence between two…
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…
The spectral properties of the Laplacian operator on ``small-world'' lattices, that is mixtures of unidimensional chains and random graphs structures are investigated numerically and analytically. A transfer matrix formalism including a…