Related papers: Nonlinear spectral graph theory
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then…
We give a characterisation of the spectral properties of linear differential operators with constant coefficients, acting on functions defined on a bounded interval, and determined by general linear boundary conditions. The boundary…
In this paper, we introduce a graph structure called linear dependence graph of a finite dimensional vector space over a finite field. Some basic properties of the graph like connectedness, completeness, planarity, clique number, chromatic…
We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
We study the discrete version of the $p$-Laplacian. Based on its variational properties we discuss some features of the associated parabolic problem. Our approach allows us in turn to obtain interesting information about positivity and…
This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…
The celebrated Cheeger's Inequality \cite{am85,a86} establishes a bound on the expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the…
We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We analyse spectral properties of this Laplacian under a Kirchhoff assumption. Moreover we establish isoperimet-ric inequalities in terms of the…
We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper we show that several NP-hard zero forcing numbers are not…
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 define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect the…
Lattice structures play a central role in spectral graph theory, offering analytical insight into diffusion, synchronization, and transport processes on regular discrete spaces. While their spectral properties are completely characterized…
We present an analog to classic potential theory on weighted graphs. With nodes partitioned into exterior, boundary and interior nodes and an appropriate decomposition of the Laplacian, we define discrete analogues to the trace operators,…
We prove Cheeger inequalities for p-Laplacians on finite and infinite weighted graphs. Unlike in previous works, we do not impose boundedness of the vertex degree, nor do we restrict ourselves to the normalized Laplacian and, more…
In this work we develop a nonlinear decomposition, associated with nonlinear eigenfunctions of the p-Laplacian for p \in (1, 2). With this decomposition we can process signals of different degrees of smoothness. We first analyze solutions…
On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…