Related papers: Eigenvalues of Laplacians on Higher Dimensional Vi…
We study the spectral decomposition of the Laplacian on a family of fractals $\mathcal{VS}_n$ that includes the Vicsek set for $n=2$, extending earlier research on the Sierpinski Gasket. We implement an algorithm [24] for spectral…
We study the spectral properties of a fractal VNLE obtained from the standard Vicsek set VS by making a countable number of identifications of points so that all the line segments in VS become circles in VNLE. We show that the standard…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
A central issue in the study of polymer physics is to understand the relation between the geometrical properties of macromolecules and various dynamics, most of which are encoded in the Laplacian spectra of a related graph describing the…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
We construct a one-parameter family of Laplacians on the Sierpinski Gasket that are symmetric and self-similar for the 9-map iterated function system obtained by iterating the standard 3-map iterated function system. Our main result is the…
In this paper we study two classes of graphs, the (m,k)-stars and l-dependent graphs, investigating the relation between spectrum characteristics and graph structure: conditions on the topology and edge weights are given in order to get…
Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…
We use spectral decimation to provide formulae for computing the harmonic gradients of Laplacian eigenfunctions on the Sierpinski Gasket. These formulae are given in terms of special functions that are defined as infinite products.
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
In this paper, we obtain a comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs and discuss its rigidity. As applications of the comparison of eigenvalues, we obtain Lichnerowicz-type estimates and some combinatorial…
We study the spectral zeta functions of the Laplacian on fractal sets which are locally self-similar fractafolds, in the sense of Strichartz. These functions are known to meromorphically extend to the entire complex plane, and the locations…
In this text we consider discrete Laplace operators defined on lattices based on finitely-ramified self-similar sets, and their continuous analogous defined on the self-similar sets themselves. We are interested in the spectral properties…
We study the spectrum of the Laplacian on the Sierpinski lattices. First, we show that the spectrum of the Laplacian, as a subset of $\mathbb{C}$, remains the same for any $\ell^p$ spaces. Second, we characterize all the spectral points for…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…
We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on…
It is known that the small eigenvalues of the Laplacian of a Riemann surface close to the boundary of the modular space can be well approximated by the eigenvalues of the discrete Laplacian on a certain graph coming from the pair of pants…
A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…