相关论文: Vibration Spectra of the $m$-Tree Fractal

We adapt the well-known spectral decimation technique for computing spectra of Laplacians on certain symmetric self-similar sets to the case of magnetic Schrodinger operators and work through this method completely for the diamond lattice…

We study spectra of noncommutative dynamical systems, representations of fractal groups, and regular graphs. We explicitly compute these spectra for five examples of groups acting on rooted trees, and in three cases obtain totally…

Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…

We give the first example of a connected 4-regular graph whose Laplace operator's spectrum is a Cantor set, as well as several other computations of spectra following a common ``finite approximation'' method. These spectra are simple…

The method of spectral decimation is applied to an infinite collection of self--similar fractals. The sets considered belong to the class of nested fractals, and are thus very symmetric. An explicit construction is given to obtain formulas…

In this article we study the energy level spectrum of fractals which have block-hierarchical structures. We develop a method to study the spectral properties in terms of linearization of spectral decimation procedure and verify it…

We show a norm convergence result for the Laplacian on a class of post-critically finite fractals with arbitrary Borel regular probability measure which can be approximated by a sequence of finite-dimensional graph Laplacians with…

We study basic spectral features of graph Laplacians associated with a class of rooted trees which contains all regular trees. Trees in this class can be generated by substitution processes. Their spectra are shown to be purely absolutely…

A fractafold, a space that is locally modeled on a specified fractal, is the fractal equivalent of a manifold. For compact fractafolds based on the Sierpinski gasket, it was shown by the first author how to compute the discrete spectrum of…

Kirchhoff showed that the number of spanning trees of a graph is the spectral determinant of the combinatorial Laplacian divided by the number of vertices; we reframe this result in the quantum graph setting. We prove that the spectral…

For dendrite graphs from biological experiments on mouse's retinal ganglion cells, a paper by Nakatsukasa, Saito and Woei reveals a mysterious phase transition phenomenon in the spectra of the corresponding graph Laplacian matrices. While…

The eigenvalues of the normalized Laplacian matrix of a network plays an important role in its structural and dynamical aspects associated with the network. In this paper, we study the spectra and their applications of normalized Laplacian…

The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…

In this survey article, we investigate the spectral properties of fractal differential operators on self-similar fractals. In particular, we discuss the decimation method, which introduces a renormalization map whose dynamics describes the…

We study the Laplacian on family preserving metric graphs. These are graphs that have a certain symmetry that, as we show, allows for a decomposition into a direct sum of one-dimensional operators whose properties are explicitly related to…

This paper investigates spectral properties of the deformed Laplacian matrix, which merges the Laplacian and signless Laplacian matrices of a graph through a one-parameter family of matrices. We present general results on the eigenvalues of…

Constructing and studying distributed control systems requires the analysis of the Laplacian spectra and the forest structure of directed graphs. In this paper, we present some basic results of this analysis partially obtained by the…

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 study and calculation of spectrum of networks can be used to describe networks structure and quantify analysis of networks performance. The fractal M\"{o}bius octagonal networks, denoted by $Q_n$, is derived from the inverse…

In this paper, we interpret the multiplicity of 1 in Laplacian spectra of trees and prove that Faria's inequality turns to an equality in the case of normal trees which yields that in any tree without a vertex of degree 2, Faria equality…