Related papers: $p$-Laplacian Operators on Hypergraphs
In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians, i.e., symmetric matrices with non-positive off-diagonal entries. In this paper, we establish nodal domain…
The goal of this note is to consider Liouville type theorem for p-Laplacian type operators. In particular guided by the Laplacian case one establishes analogous results for the p-Laplacian and operators of this type.
The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…
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…
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…
We present a construction of a large class of Laplace invariants for linear hyperbolic partial differential operators of fairly general form and arbitrary order.
In this paper we study numerical approximations of the evolution problem for the nonlocal $p$-Laplacian operator with homogeneous Neumann boundary conditions on inhomogeneous random convergent graph sequences. More precisely, for networks…
Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…
We study the phenomena that arise when we combine the standard pseudodifferential operators with those operators that appear in the study of some sub-elliptic estimates, and on strongly pseudoconvex domains. The algebra of operators we…
Under the lack of variational structure and nondegeneracy, we investigate three notions of \textit{generalized principal eigenvalue} for a general infinity Laplacian operator with gradient and homogeneous term. A Harnack inequality and…
A new class of operators, larger than $C$-symmetric operators and different than normal one, named $C$--normal operators is introduced. Basic properties are given. Characterizations of this operators in finite dimensional spaces using a…
We define a class of discrete operators acting on infinite, finite or periodic sequences mimicking the standard properties of pseudo-differential operators. In particular we can define the notion of order and regularity, and we recover the…
Before we proposed an algebraic technics for the Hamiltonian approach to the evolution systems of partial differential equations, including systems with constraints. Here we further develop this approach and present the defining system of…
The aim of the article is to prove $L^{p}-L^{q}$ off-diagonal estimates and $L^{p}-L^{q}$ boundedness for operators in the functional calculus of certain perturbed first order differential operators of Dirac type for with $p\le q$ in a…
Graph Laplacians computed from weighted adjacency matrices are widely used to identify geometric structure in data, and clusters in particular; their spectral properties play a central role in a number of unsupervised and semi-supervised…
This article explains the relationship between analytic and algebraic order in case of abstract pseudo-differential operators for a regular spectral triple.
We consider an arbitrary metric graph, to which we glue another graph with edges of lengths proportional to $\varepsilon$, where $\varepsilon$ is a small positive parameter. On such graph, we consider a general self-adjoint second order…
Higher-order networks encode the many-body interactions existing in complex systems, such as the brain, protein complexes, and social interactions. Simplicial complexes are higher-order networks that allow a comprehensive investigation of…
This paper investigates the use of methods from partial differential equations and the Calculus of variations to study learning problems that are regularized using graph Laplacians. Graph Laplacians are a powerful, flexible method for…
The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the…