Related papers: A graph discretization of vector Laplace operator
In this paper we study two classes of graphs, the (m,k)-stars and l-dependent graphs, investigating the relation between spectrum characteristics and graph structure: conditions on the topology and edge weights are given in order to get…
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include…
A higher dimensional generalization of the cross product is associated with an adequate matrix multiplication. This index-free view allows for a better understanding of the underlying algebraic structures, among which are generalizations of…
Let $G=(V,E)$ be a finite graph and $\Delta$ be the usual graph Laplacian. Using the calculus of variations and a method of upper and lower solutions, we give various conditions such that the Kazdan-Warner equation $\Delta u=c-he^u$ has a…
Let ${M}$ be a compact Riemannian submanifold of ${{\bf R}^m}$ of dimension $\scriptstyle{d}$ and let ${X_1,...,X_n}$ be a sample of i.i.d. points in ${M}$ with uniform distribution. We study the random operators $$…
Starting from the approach to the Laplacian with respect to coupling measures and undirected weighted graphs, we provide a setting for a general point of view for a Kirchhoff type divergence and a Laplace operators built on the trivial…
Due to their flexibility to represent almost any kind of relational data, graph-based models have enjoyed a tremendous success over the past decades. While graphs are inherently only combinatorial objects, however, many prominent analysis…
Recently, we have introduced and modified two graph-decomposition theorems based on a new graph product, motivated by applications in the context of synchronising periodic real-time processes. This vertex-removing synchronised product…
This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…
A graph is called "Laplacian integral" if the eigenvalues of its Laplacian matrix are all integers. We investigate the subset of these graphs whose Laplacian is furthermore diagonalized by a matrix with entries coming from a fixed set, in…
This thesis generalizes the differential operators on standard oriented graphs and oriented hypergraphs introduced in 10.1137/15M1022793 and arXiv:2007.00325. The extended concepts of gradients, adjoints and $p$-Laplacians for vertices and…
Distinguishing sets of quantum states shared by two parties using only local operations and classical communication measurements is a fundamental topic in quantum communication and quantum information theory. We introduce a graph-theoretic…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…
As a nonlinear extension of the graph Laplacian, the graph $p$-Laplacian has various applications in many fields. Due to the nonlinearity, it is very difficult to compute the eigenvalues and eigenfunctions of graph $p$-Laplacian. In this…
The main objective of the present work is to study the negative spectrum of (differential) Laplace operators on metric graphs as well as their resolvents and associated heat semigroups. We prove an upper bound on the number of negative…
A metrized graph is a finite weighted graph whose edges are thought of as line segments. In this expository paper, we study the Laplacian operator on a metrized graph and some important functions related to it, including the ``j-function'',…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…
New identities on traces of representations of the Hecke algebra on the spaces of paths on graphs are presented. These identities are relevant in the computation of partition functions with fixed boundary conditions and of two-point…