Related papers: Nonlinear spectral graph theory
We initiate a systematic study of spectral theory for bounded-degree Borel pmp graphs. Specifically, we study spectral properties of the associated adjacency and Laplacian operators. We start with proving a spectral characterization of…
This note introduces a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of undirected graphs with self-loops. We extend on the known results for the spectrum of undirected graphs without self-loops or…
Nonlinear eigenvalue problems arise in a wide range of physical systems, in which system parameters depend on the eigenvalue. Such systems have been proposed to exhibit an extreme sensitivity of their spectra to boundary conditions, which…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…
We introduce and develop equivalent spectral graph theory for several fundamental graph cut problems including maxcut, mincut, Cheeger cut, anti-Cheeger cut, dual Cheeger problem and their useful variants. A specified strategy for achieving…
In this article we discuss the solvability of some class of fully nonlinear equations, and equations with p-Laplacian in more general conditions by using a new approach given in [1] for studying the nonlinear continuous operator. Moreover…
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…
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 show that arising out of noncmmutatve geometry is a natural family of {\em edge Laplacians} on the edges of a graph. The family includes a canonical edge Laplacian associated to the graph, extending the usual graph Laplacian on vertices,…
Generative models for graphs have been typically committed to strong prior assumptions concerning the form of the modeled distributions. Moreover, the vast majority of currently available models are either only suitable for characterizing…
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…
We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…
We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…
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…
Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning from observed samples is an NP-hard combinatorial problem. In…
Defining a sound shift operator for signals existing on a certain graph structure, similar to the well-defined shift operator in classical signal processing, is a crucial problem in graph signal processing, since almost all operations, such…
Signed graphs are graphs whose edges get a sign $+1$ or $-1$ (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much…
In this article we study the well-posedness (uniqueness and existence of solutions) of nonlinear elliptic Partial Differential Equations (PDEs) on a finite graph. These results are obtained using the discrete comparison principle and…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…
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…