Related papers: Laplacians on periodic discrete graphs
Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…
In manifold learning, algorithms based on graph Laplacians constructed from data have received considerable attention both in practical applications and theoretical analysis. In particular, the convergence of graph Laplacians obtained from…
We introduce the the fractional Laplacian on a subgraph of a graph with Dirichlet boundary condition. For a lattice graph, we prove the upper and lower estimates for the sum of the first $k$ Dirichlet eigenvalues of the fractional…
In this work we consider the Laplacian controllability of a graph constructed by interconnecting a finite number of single-input Laplacian controllable graphs. We first study the interconnection realized by the composite graph of two…
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 consider compact metric graphs with an arbitrary self adjoint realisation of the differential Laplacian. After discussing spectral properties of Laplacians, we prove several versions of trace formulae, relating Laplace spectra to sums…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
This paper uses the technology of weighted and regular triangulations to study discrete versions of the Laplacian on piecewise Euclidean manifolds. Regular triangulations are studied in some detail, including flip algorithms. The Laplacian…
Two graphs are said to be $Q$-cospectral if they share the same signless Laplacian spectrum. A simple graph is said to be determined by its signless Laplacian spectrum (abbreviated as DQS) if there exists no other non-isomorphic simple…
We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…
{Signless Laplacian determinations of some graphs with independent edges}% {Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the…
We study the Laplacian on a metrized graph, and its eigenfunctions.
We compute spectra of symmetric random matrices describing graphs with general modular structure and arbitrary inter- and intra-module degree distributions, subject only to the constraint of finite mean connectivities. We also evaluate…
Separating multiple graph signals from a single observed mixture is an inherently ill-posed problem that traditionally relies on restrictive and handcrafted priors. This letter addresses this challenge by proposing an unsupervised learnable…
In this paper we investigate the controllability and observability properties of a family of linear dynamical systems, whose structure is induced by the Laplacian of a grid graph. This analysis is motivated by several applications in…
In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a…
In this paper we investigate the spectral and the scattering theory of Gauss--Bonnet operators acting on perturbed periodic combinatorial graphs. Two types of perturbation are considered: either a multiplication operator by a short-range or…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
The spectral properties of the restricted fractional Laplacian with Dirichlet boundary conditions in a smoothly bent waveguide is investigated. The existence of eigenvalues below the threshold of the continuous spectrum is proved,…