Related papers: Singular Continuous Spectrum for the Laplacian on …
We study notions of hyperuniformity for invariant locally square-integrable point processes in regular trees. We show that such point processes are never geometrically hyperuniform, and if the diffraction measure has support in the…
According to a recent conjecture, isospectral objects have different nodal count sequences. We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counter-examples to this conjecture. In…
We introduce a class of combinatorial singularities of Lagrangian skeleta of symplectic manifolds. The link of each singularity is a finite regular cell complex homotopy equivalent to a bouquet of spheres. It is determined by its face poset…
The spectral properties of the restricted fractional Dirichlet Laplacian in ${\sf V}$-shaped waveguides are studied. The continuous spectrum for such domains with cylindrical outlets is known to occupy the ray $[\Lambda_\dagger, +\infty)$…
We consider Laplacians on periodic equilateral metric graphs. The spectrum of the Laplacian consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite number of flat…
The spectrum of Laplacian and signless Laplacian matrix for a graph product is obtained, where both underlying graphs are regular. As an application of this, we have been able to generate the Kirchhoff Index and Wiener Index and determine…
We estabish rigorous estimates for the Hausdorff dimension of the spectra of Laplacians associated to Sierpi\'nski lattices and infinite Sierpi\'nski gaskets and other post-critically finite self-similar sets.
This article deals with the spectra of Laplacians of weighted graphs. In this context, two objects are of fundamental importance for the dynamics of complex networks: the second eigenvalue of such a spectrum (called algebraic connectivity)…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
For a finite graph, a spectral curve is constructed as the zero set of a two-variate polynomial with integer coefficients coming from p-adic diffusion on the graph. It is shown that certain spectral curves can distinguish non-isomorphic…
We provide two examples of spectral analysis techniques of Schroedinger operators applied to geometric Laplacians. In particular we show how to adapt the method of analytic dilation to Laplacians on complete manifolds with corners of…
We consider a Laplacian on periodic discrete graphs. Its spectrum consists of a finite number of bands. In a class of periodic 1-forms, i.e., functions defined on edges of the periodic graph, we introduce a subclass of minimal forms with a…
We characterize the spectrum of the Laplacian of graphs composed of one or two finite or infinite chains connected to a complete graph. We show the existence of localized eigenvectors of two types, eigenvectors that vanish exactly outside…
Formulas for matrix determinants, algebraic adjunctions, characteristic polynomial coefficients, components of eigenvectors are obtained in the form of signless sums of matrix elements products taking by special graphs. Signless formulas…
The complete knowledge of Laplacian eigenvalues and eigenvectors of complex networks plays an outstanding role in understanding various dynamical processes running on them; however, determining analytically Laplacian eigenvalues and…
Recent spectral graph sparsification research allows constructing nearly-linear-sized subgraphs that can well preserve the spectral (structural) properties of the original graph, such as the first few eigenvalues and eigenvectors of the…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
The scale and complexity of modern data sets and the limitations associated with testing large numbers of hypotheses underline the need for feature selection methods. Spectral techniques rank features according to their degree of…
Using generating functions techniques we develop a relation between the Hausdorff and spectral dimension of trees with a unique infinite spine. Furthermore, it is shown that if the outgrowths along the spine are independent and identically…
In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than $1$ are simple and also the multiplicity of Laplacian eigenvalue $1$ has been well studied…