Related papers: Nodal Statistics On Quantum Graphs
The paper deals with asymptotic nodal geometry for the Laplace-Beltrami operator on closed surfaces. Given an eigenfunction f corresponding to a large eigenvalue, we study local asymmetry of the distribution of sign(f) with respect to the…
We study the limit distribution of zeros of certain sequences of holomorphic sections of high powers $L^N$ of a positive holomorphic Hermitian line bundle $L$ over a compact complex manifold $M$. Our first result concerns `random' sequences…
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…
This paper is a continuation and an extension of our recent work [3] on the geometric structures of Laplacian eigenfunctions and their applications to inverse scattering problems. In [3], the analytic behaviour of the Laplacian…
Discrete amorphous materials are best described in terms of arbitrary networks which can be embedded in three dimensional space. Investigating the thermodynamic equilibrium as well as non-equilibrium behavior of such materials around second…
The existence of non-isomorphic graphs which share the same Laplace spectrum (to be referred to as isospectral graphs) leads naturally to the following question: What additional information is required in order to resolve isospectral…
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…
The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…
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 describe extensive computational experiments on spectral properties of random objects - random cubic graphs, random planar triangulations, and Voronoi and Delaunay diagrams of random (uniformly distributed) point sets on the sphere). We…
Using the spectral multiplicities of the standard torus, we endow the Laplace eigenspaces with Gaussian probability measures. This induces a notion of random Gaussian Laplace eigenfunctions on the torus ("arithmetic random waves"). We study…
We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for…
We study the expected behavior of the Betti numbers of arrangements of the zeros of random (distributed according to the Kostlan distribution) polynomials in $\mathbb{R}\mathrm{P}^n$. Using a random spectral sequence, we prove an…
Sequences of nodal counts store information on the geometry (metric) of the domain where the wave equation is considered. To demonstrate this statement, we consider the eigenfunctions of the Laplace-Beltrami operator on surfaces of…
Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…
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…
Node features bolster graph-based learning when exploited jointly with network structure. However, a lack of nodal attributes is prevalent in graph data. We present a framework to recover completely missing node features for a set of…
Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…
In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…
We propose the notion of normalized Laplacian matrix $\mathcal{L}(\Phi)$ for a gain graphs and study its properties in detail, providing insights and counterexamples along the way. We establish bounds for the eigenvalues of…