Related papers: Spectral Theory for Discrete Lapacians
In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…
This paper provides a framework to evaluate the performance of single and double integrator networks over arbitrary directed graphs. Adopting vehicular network terminology, we consider quadratic performance metrics defined by the L2-norm of…
The discrete Green's functions are the pseudoinverse (or the inverse) of the Laplacian (or its variations) of a graph. In this paper, we will give combinatorial interpretations of Green's functions in terms of enumerating trees and forests…
Let $$L_0=\suml_{j=1}^nM_j^0D_j+M_0^0,\,\,\,\,D_j=\frac{1}{i}\frac{\pa}{\paxj}, \quad x\in\Rn,$$ be a constant coefficient first-order partial differential system, where the matrices $M_j^0$ are Hermitian. It is assumed that the homogeneous…
In the recent literature, various authors have studied spectral comparison results for Schr\"odinger operators with discrete spectrum in different settings including Euclidean domains and quantum graphs. In this note we derive such spectral…
Graphs possess exotic features like variable size and absence of natural ordering of the nodes that make them difficult to analyze and compare. To circumvent this problem and learn on graphs, graph feature representation is required. A good…
Trace formulae for d-regular graphs are derived and used to express the spectral density in terms of the periodic walks on the graphs under consideration. The trace formulae depend on a parameter w which can be tuned continuously to assign…
We offer a spectral analysis for a class of transfer operators. These transfer operators arise for a wide range of stochastic processes, ranging from random walks on infinite graphs to the processes that govern signals and recursive wavelet…
This survey is two-fold. We first report new progress on the spectral extremal results on the Tur\'{a}n type problems in graph theory. More precisely, we shall summarize the spectral Tur\'{a}n function in terms of the adjacency spectral…
Let $G$ be a connected graph and let $k$ be a positive integer. Let $T$ be a spanning tree of $G$. The leaf degree of a vertex $v\in V(T)$ is defined as the number of leaves adjacent to $v$ in $T$. The leaf degree of $T$ is the maximum leaf…
We establish a spectral duality for certain unbounded operators in Hilbert space. The class of operators includes discrete graph Laplacians arising from infinite weighted graphs. The problem in this context is to establish a practical…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
We establish an asymptotic relation between the spectrum of the discrete Laplacian associated to discretizations of a half-translation surface with a flat unitary vector bundle and the spectrum of the Friedrichs extension of the Laplacian…
The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
Let $G$ be a graph with adjacency matrix $A\left( G\right) $, and let $D\left( G\right) $ be the diagonal matrix of the degrees of $G.$ The signless Laplacian $Q\left( G\right) $ of $G$ is defined as $Q\left( G\right) :=A\left( G\right)…
In this paper, we present two new matrices, namely the resistance Laplacian and resistance signless Laplacian matrix of a connected graph. We provide a generalized form of these matrices for different classes of graphs, including the…
Let $m_G(I)$ denote the number of Laplacian eigenvalues of a graph $G$ in an interval $I$, and let $\gamma(G)$ denote its domination number. We extend the recent result $m_G[0,1) \leq \gamma(G)$, and show that isolate-free graphs also…
We study the asymptotic expansion of the determinant of the graph Laplacian associated to discretizations of a half-translation surface endowed with a flat unitary vector bundle. By doing so, over the discretizations, we relate the…
This paper is a survey article on the limiting behavior of the discrete spectrum of the right regular representation in $L^2(\Gamma\bs G)$ for a lattice $\Gamma$ in a reductive group $G$ over a number field. We discuss various aspects of…