Related papers: Urschel Nodal Domains via Perturbation Theory
Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the well-known Courant's nodal domain theorem on continuous…
The eigenvectors for graph $1$-Laplacian possess some sort of localization property: On one hand, any nodal domain of an eigenvector is again an eigenvector with the same eigenvalue; on the other hand, one can pack up an eigenvector for a…
Courant theorem provides an upper bound for the number of nodal domains of eigenfunctions of a wide class of Laplacian-type operators. In particular, it holds for generic eigenfunctions of quantum graph. The theorem stipulates that, after…
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…
We obtain upper bounds on the number of nodal domains of Laplace eigenfunctions on chain domains with Neumann boundary conditions. The chain domains consist of a family of planar domains, with piecewise smooth boundary, that are joined by…
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…
Courant's theorem implies that the number of nodal domains of a Laplace eigenfunction is controlled by the corresponding eigenvalue. Over the years, there have been various attempts to find an appropriate generalization of this statement in…
We consider the eigenvalues of the Laplacian on an open, bounded, connected set in $\mathbb{R}^n$ with $C^2$ boundary, with a Neumann boundary condition or a Robin boundary condition. We obtain upper bounds for those eigenvalues that have a…
We prove two types of nodal results for density one subsequences of an orthonormal basis $\{\phi_j\}$ of eigenfunctions of the Laplacian on a negatively curved compact surface. The first type of result involves the intersections $Z_{\phi_j}…
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relatively little is known about the corresponding eigenvectors. Our…
We study the structure of eigenfunctions of the Laplacian on quantum graphs, with a particular focus on Morse eigenfunctions via nodal and Neumann domains. Building on Courant-type arguments, we establish upper bounds for the number of…
We are interested in the number of nodal domains of eigenfunctions of sub-Laplacians on sub-Riemannian manifolds. Specifically, we investigate the validity of Pleijel's theorem, which states that, as soon as the dimension is strictly larger…
We establish various nodal domain theorems for $p$-Laplacians on signed graphs, which unify most of the existing results on nodal domains of graph $p$-Laplacians and arbitrary symmetric matrices. Based on our nodal domain estimates, we…
\AA. Pleijel (1956) has proved that in the case of the Laplacian with Dirichlet condition, the equality in the Courant nodal theorem (Courant sharp situation) can only be true for a finite number of eigenvalues when the dimension is $\geq…
We study the principal Dirichlet eigenfunction $\varphi_U$ when the domain $U$ is a perturbation of a bounded inner uniform domain in a strictly local regular Dirichlet space. We prove that if $U$ is suitably contained in between two inner…
Let $(M, g)$ be a closed Riemannian manifold, where g is $C^1$-smooth metric. Consider the sequence of eigenfunctions $u_k$ of the Laplace operator on M. Let $B$ be a ball on $M$. We prove a sharp estimate of the number of nodal domains of…
The nodal domains of eigenvectors of the discrete Schrodinger operator on simple, finite and connected graphs are considered. Courant's well known nodal domain theorem applies in the present case, and sets an upper bound to the number of…
We prove that every metric graph which is a tree has an orthonormal sequence of Laplace-eigenfunctions of full support. This implies that the number of nodal domains $\nu_n$ of the $n$-th eigenfunction of the Laplacian with standard…
In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians. In 2019, Jost and Mulas generalized the normalized combinatorial Laplace operator of graphs to signed…
The Neumann points of an eigenfunction $f$ on a quantum (metric) graph are the interior zeros of $f'$. The Neumann domains of $f$ are the sub-graphs bounded by the Neumann points. Neumann points and Neumann domains are the counterparts of…