Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications

Abstract

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 matrices of a family of fractal trees and dendrimers modeled by Cayley trees, both of which are built in an iterative way. For the fractal trees, we apply the spectral decimation approach to determine analytically all the eigenvalues and their corresponding multiplicities, with the eigenvalues provided by a recursive relation governing the eigenvalues of networks at two successive generations. For Cayley trees, we show that all their eigenvalues can be obtained by computing the roots of several small-degree polynomials defined recursively. By using the relation between normalized Laplacian spectra and eigentime identity, we derive the explicit solution to the eigentime identity for random walks on the two treelike networks, the leading scalings of which follow quite different behaviors. In addition, we corroborate the obtained eigenvalues and their degeneracies through the link between them and the number of spanning trees.

Definitive version accepted for publication in The Journal of Chemical Physics

References in corpus (11)

• Critical phenomena in complex networks
• First-passage times in complex scale-invariant media
• Random walks on weighted networks
• Trapping in dendrimers and regular hyperbranched polymers
• Laplacian spectra of recursive treelike small-world polymer networks: Analytical solutions and applications
• Dynamics of continuous-time quantum walks in restricted geometries
• Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
• Topologies and Laplacian spectra of a deterministic uniform recursive tree
• Recursive solutions for Laplacian spectra and eigenvectors of a class of growing treelike networks
• Random Walks on Complex Networks
• Spectral densities of scale-free networks

Cited by in corpus (12)

• Properties of hydrogen bonded network in ethanol-water liquid mixtures as a function of temperature: diffraction experiments and computer simulations
• Heterogeneous continuous time random walks
• Maximal entropy random walk improves efficiency of trapping in dendrimers
• Molecular aggregation in liquid water: Laplace spectra and spectral clustering of H-bonded network
• Spectrum of the tight-binding model on Cayley Trees and comparison with Bethe Lattices
• Temperature dependent network stability in simple alcohols and pure water: the evolution of Laplace spectra
• Anomalous behavior of trapping in extended dendrimers with a perfect trap
• Analytical controllability of deterministic scale-free networks and Cayley trees
• Generalized Flory Theory for Rotational Symmetry Breaking of Complex Macromolecules
• Structural and temporal heterogeneities on networks
• The normalized Laplacian spectrum and eigentime identities of hype-cubes
• Minimum leader selection for Structural Controllability of Undirected Graphs with Leader-follower Framework