Topologies and Laplacian spectra of a deterministic uniform recursive tree

Simple item page
dc.creatorZhang, Zhongzhi
dc.creatorZhou, Shuigeng
dc.creatorQi, Yi
dc.creatorGuan, Jihong
dc.date2008-01-27
dc.date2008-06-25
dc.date.accessioned2026-07-07T09:49:30Z
dc.date.available2026-07-07T09:49:30Z
dc.descriptionThe uniform recursive tree (URT) is one of the most important models and has been successfully applied to many fields. Here we study exactly the topological characteristics and spectral properties of the Laplacian matrix of a deterministic uniform recursive tree, which is a deterministic version of URT. Firstly, from the perspective of complex networks, we determine the main structural characteristics of the deterministic tree. The obtained vigorous results show that the network has an exponential degree distribution, small average path length, power-law distribution of node betweenness, and positive degree-degree correlations. Then we determine the complete Laplacian spectra (eigenvalues) and their corresponding eigenvectors of the considered graph. Interestingly, all the Laplacian eigenvalues are distinct.
dc.description7 pages, 1 figures, definitive version accepted for publication in EPJB
dc.identifierhttps://arxiv.org/abs/0801.4128
dc.identifierhttp://arxiv.org/abs/0801.4128
dc.identifierEur. Phys. J. B 63, 507-513 (2008).
dc.identifierdoi:10.1140/epjb/e2008-00262-2
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/164610
dc.subjectStatistical Mechanics
dc.titleTopologies and Laplacian spectra of a deterministic uniform recursive tree
dc.typetext

Files

Collections

arXiv