Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions

Simple item page
dc.creatorQi, Yi
dc.creatorZhang, Zhongzhi
dc.creatorDing, Bailu
dc.creatorZhou, Shuigeng
dc.creatorGuan, Jihong
dc.date2008-12-08
dc.date2009-04-02
dc.date.accessioned2026-07-07T12:58:52Z
dc.date.available2026-07-07T12:58:52Z
dc.descriptionAs one of the most significant models, the uniform recursive tree (URT) has found many applications in a variety of fields. In this paper, we study rigorously the structural features and spectral properties of the adjacency matrix for a family of deterministic uniform recursive trees (DURTs) that are deterministic versions of URT. Firstly, from the perspective of complex networks, we investigate analytically the main structural characteristics of DURTs, and obtain the accurate solutions for these properties, which include degree distribution, average path length, distribution of node betweenness, and degree correlations. Then we determine the complete eigenvalues and their corresponding eigenvectors of the adjacency matrix for DURTs. Our research may shed light in better understanding of the features for URT. Also, the analytical methods used here is capable of extending to many other deterministic networks, making the precise computation of their properties (especially the full spectrum characteristics) possible.
dc.descriptionDefinitive version published in Journal of Physics A: Mathematical and Theoretical
dc.identifierhttps://arxiv.org/abs/0812.1456
dc.identifierhttp://arxiv.org/abs/0812.1456
dc.identifierJ. Phys. A: Math. Theor. 42 (2009) 165103
dc.identifierdoi:10.1088/1751-8113/42/16/165103
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225392
dc.subjectStatistical Mechanics
dc.titleStructural and spectral properties of a family of deterministic recursive trees: Rigorous solutions
dc.typetext

Files

Collections

arXiv