Topologies and Laplacian spectra of a deterministic uniform recursive tree
Abstract
The 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.
- Publication:
-
European Physical Journal B
- Pub Date:
- June 2008
- DOI:
- 10.1140/epjb/e2008-00262-2
- arXiv:
- arXiv:0801.4128
- Bibcode:
- 2008EPJB...63..507Z
- Keywords:
-
- 89.75.Hc;
- 02.10.Yn;
- 02.10.Ud;
- 89.75.Fb;
- Networks and genealogical trees;
- Matrix theory;
- Linear algebra;
- Structures and organization in complex systems;
- Condensed Matter - Statistical Mechanics
- E-Print:
- 7 pages, 1 figures, definitive version accepted for publication in EPJB