Related papers: Nodal domain theorems for $p$-Laplacians on signed…
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…
Several new spectral properties of the normalized Laplacian defined for oriented hypergraphs are shown. The eigenvalue $1$ and the case of duplicate vertices are discussed; two Courant nodal domain theorems are established; new quantities…
We introduce the signless 1-Laplacians and the dual Cheeger constants on simplicial complexes. The connection of its spectrum to the combinatorial properties like independence number, chromatic number and dual Cheeger constant is…
Inspired by persistent homology in topological data analysis, we introduce the homological eigenvalues of the graph $p$-Laplacian $\Delta_p$, which allows us to analyse and classify non-variational eigenvalues. We show the stability of…
In this paper, we give tight bounds for the normalized Laplacian eigenvalues of hypergraphs that are not necessarily uniform, and provide an edge version interlacing theorem, a Cheeger inequality, and a discrepancy inequality that are…
We prove several classification results for $p$-Laplacian problems on bounded and unbounded domains, and deal with qualitative properties of sign-changing solutions to $p$-Laplacian equations on $\mathbb R^N$ involving critical…
In this paper, we introduce isocapacitary constants for the $p$-Laplacian on graphs and apply them to derive estimates for the first eigenvalues of the Dirichlet $p$-Laplacian, the Neumann $p$-Laplacian, and the $p$-Steklov problem.
We study the eigenvalues of the connection Laplacian on a graph with an orthogonal group or unitary group signature. We establish higher order Buser type inequalities, i.e., we provide upper bounds for eigenvalues in terms of Cheeger…
The data clustering problem consists in dividing a data set into prescribed groups of homogeneous data. This is a NP-hard problem that can be relaxed in the spectral graph theory, where the optimal cuts of a graph are related to the…
We consider the real eigenfunctions of the Schr\"odinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds $B$. For well connected graphs, with…
We prove the Pleijel theorem in non-collapsed RCD spaces, providing an asymptotic upper bound on the number of nodal domains of Laplacian eigenfunctions. As a consequence, we obtain that the Courant nodal domain theorem holds except at most…
For any subgraph of a graph, the Laplacian with Neumann boundary condition was introduced by Chung and Yau [CY94]. In this paper, motivated by the Riemannian case, we introduce the Cheeger constants for Neumann problems and prove…
In this paper, we successfully establish a Courant-type nodal domain theorem for both the Dirichlet eigenvalue problem and the closed eigenvalue problem of the Witten-Laplacian. Moreover, we also characterize the properties of the nodal…
We study the $p$-independence of spectra of Laplace operators on graphs arising from regular Dirichlet forms on discrete spaces. Here, a sufficient criterion is given solely by a uniform subexponential growth condition. Moreover, under a…
In this paper we consider the Cheeger problem for non-convex domains, with a particular interest in the case of planar strips, which have been extensively studied in recent years. Our main results are an estimate on the Cheeger constant of…
We prove a Li-Yau type eigenvalue-diameter estimate for signed graphs. That is, the nonzero eigenvalues of the Laplacian of a non-negatively curved signed graph are lower bounded by $1/D^2$ up to a constant, where $D$ stands for the…
The nodal set of a Laplacian eigenfunction forms a partition of the underlying manifold or graph. Another natural partition is based on the gradient vector field of the eigenfunction (on a manifold) or on the extremal points of the…
We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard…
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturm's theorem for the strings applies to the theory of membranes:…