Related papers: Neumann Domains on Quantum Graphs
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…
Generalizing Courant's nodal domain theorem, the "Extended Courant property" is the statement that a linear combination of the first $n$ eigenfunctions has at most $n$ nodal domains. A related question is to estimate the number of connected…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
We consider the fractal characteristic of the quantum mechanical paths and we obtain for any universal class of fractons labeled by the Hausdorff dimension defined within the interval 1$ $$ < $$ $$h$$ $$ <$$ $$ 2$, a fractal distribution…
It has been suggested that the distribution of the suitably normalized number of zeros of Laplacian eigenfunctions contains information about the geometry of the underlying domain. We study this distribution (more precisely, the…
We study Neumann functions for divergence form, second order elliptic systems with bounded measurable coefficients in a bounded Lipschitz domain or a Lipschitz graph domain. We establish existence, uniqueness, and various estimates for the…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
An eigenfunction of the Laplacian on a metric (quantum) graph has an excess number of zeros due to the graph's non-trivial topology. This number, called the nodal surplus, is an integer between 0 and the graph's first Betti number $\beta$.…
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}…
The von Neumann entropy of a graph is a spectral complexity measure that has recently found applications in complex networks analysis and pattern recognition. Two variants of the von Neumann entropy exist based on the graph Laplacian and…
We find the Courant-sharp Neumann eigenvalues of the Laplacian on some 2-rep-tile domains. In $\R^{2}$ the domains we consider are the isosceles right triangle and the rectangle with edge ratio $\sqrt{2}$ (also known as the A4 paper). In…
By considering intrinsic geometric conditions, we introduce a new class of domains in complex Euclidean space. This class is invariant under biholomorphism and includes strongly pseudoconvex domains, finite type domains in dimension two,…
The delta interaction at a vertex generalizes the Robin (generalized Neumann) boundary condition on an interval. Study of a single vertex with N infinite leads suffices to determine the localized effects of such a vertex on densities of…
We prove several types of Courant nodal domain theorems for generalized Laplacians on graphs, based on an invariant introduced by Urschel, which we call the "Urschel number", denoted ${\rm UN}({\bf f})$, of an eigenvector ${\bf f}$. We…
Parameter-dependent statistical properties of spectra of totally connected irregular quantum graphs with Neumann boundary conditions are studied. The autocorrelation functions of level velocities c(x) and c(w,x) as well as the distributions…
We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…
We consider the quantum site percolation model on graphs with an amenable group action. It consists of a random family of Hamiltonians. Basic spectral properties of these operators are derived: non-randomness of the spectrum and its…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…
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:…