Topologies and Laplacian spectra of a deterministic uniform recursive tree
arXiv:0801.4128 · doi:10.1140/epjb/e2008-00262-2
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.
7 pages, 1 figures, definitive version accepted for publication in EPJB
References in corpus (8)
- A deterministic small-world network created by edge iterations
- Recursive graphs with small-world scale-free properties
- Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
- Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
- Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network
- Correlations in random Apollonian network
- Flexible construction of hierarchical scale-free networks with general exponent
- Degree and component size distributions in generalized uniform recursive tree