Related papers: Neumann Domains on Quantum Graphs
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…
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…
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…
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 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 consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…
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…
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…
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…
One of the most famous problems in mathematics is the Riemann hypothesis: that the non-trivial zeros of the Riemann zeta function lie on a line in the complex plane. One way to prove the hypothesis would be to identify the zeros as…
Quantum graphs and their experimental counterparts, microwave networks, are ideally suited to study the spectral statistics of chaotic systems. The graph spectrum is obtained from the zeros of a secular determinant derived from energy and…
For a graph consisting of parallel connected subgraphs we express the characteristic function of the boundary value problem with generalized Neumann conditions at both joining points via characteristic functions of different boundary…
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…
We investigate the properties of the zeros of the eigenfunctions on quantum graphs (metric graphs with a Schr\"odinger-type differential operator). Using tools such as scattering approach and eigenvalue interlacing inequalities we derive…
We investigate the measure of nodal sets for Robin and Neumann eigenfunctions in the domain and on the boundary of the domain. A polynomial upper bound for the interior nodal sets is obtained for Robin eigenfunctions in the smooth domain.…
Consider an eigenvector of the adjacency matrix of a G(n, p) graph. A nodal domain is a connected component of the set of vertices where this eigenvector has a constant sign. It is known that with high probability, there are exactly two…
This paper is devoted to the Neumann-Kirchhoff Laplacian on a finite metric graph. We prove an index theorem relating the nodal deficiency of an eigenfunction with (1) the Morse index of the Dirichlet-to-Neumann map, (2) its positive index…
We consider the Laplacian on a metric graph, equipped with Robin ($\delta$-type) vertex condition at some of the graph vertices and Neumann-Kirchhoff condition at all others. The corresponding eigenvalues are called Robin eigenvalues,…