相关论文: Neumann Domains on Graphs and Manifolds

A Laplacian eigenfunction on a two-dimensional manifold dictates some natural partitions of the manifold; the most apparent one being the well studied nodal domain partition. An alternative partition is revealed by considering a set of…

A Laplacian eigenfunction on a two-dimensional Riemannian manifold provides a natural partition into Neumann domains (a.k.a. a Morse--Smale complex). This partition is generated by gradient flow lines of the eigenfunction, which bound the…

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…

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…

In this article, we illustrate and draw connections between the geometry of zero sets of eigenfunctions, graph theory and the vanishing order of eigenfunctions. We identify the nodal set of an eigenfunction of the Laplacian (with smooth…

Neumann domains of Laplacian eigenfunctions form a natural counterpart of nodal domains. The restriction of an eigenfunction to one of its nodal domains is the first Dirichlet eigenfunction of that domain. This simple observation is…

Along with the partition of a planar bounded domain $\Omega$ by the nodal set of a fixed eigenfunction of the Laplace operator in $\Omega$, one can consider another natural partition of $\Omega$ by, roughly speaking, gradient flow lines of…

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…

In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex…

We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $\nu_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr\"odinger operators…

This is a survey of recent results on eigenfunctions of the Laplacian on compact Riemannian manifolds and their nodal sets. It is the write-up of my talk at JDG 2011.

Analyzing nodal domains is a way to discern the structure of eigenvectors of operators on a graph. We give a new definition extending the concept of nodal domains to arbitrary signed graphs, and therefore to arbitrary symmetric matrices. We…

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…

We discuss Neumann problems for self-adjoint Laplacians on (possibly infinite) graphs. Under the assumption that the heat semigroup is ultracontractive we discuss the unique solvability for non-empty subgraphs with respect to the vertex…

We study the size of nodal sets of Laplacian eigenfunctions on compact Riemannian manifolds without boundary and recover the currently optimal lower bound by comparing the heat flow of the eigenfunction with that of an artifically…

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…

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…

We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…

In this note, we investigate upper bounds of the Neumann eigenvalue problem for the Laplacian of a bounded domain (with smooth boundary) in a given complete (not compact a priori) Riemannian manifold with Ricci bounded below . For this, we…

We summarize the properties of eigenvalues and eigenfunctions of the Laplace operator in bounded Euclidean domains with Dirichlet, Neumann or Robin boundary condition. We keep the presentation at a level accessible to scientists from…