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

Abstract

As 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.

Definitive version published in Journal of Physics A: Mathematical and Theoretical

References in corpus (18)

• Synchronization in complex networks
• Evolutionary games on graphs
• Critical phenomena in complex networks
• 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
• Hierarchical, Regular Small-World Networks
• Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network
• Fractal scale-free networks resistant to disease spread
• Correlations in random Apollonian network
• Topologies and Laplacian spectra of a deterministic uniform recursive tree
• Transition from fractal to non-fractal scalings in growing scale-free networks
• Transition from small to large world in growing networks
• Flexible construction of hierarchical scale-free networks with general exponent
• Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions
• Diophantine Networks
• Degree and component size distributions in generalized uniform recursive tree

Cited by in corpus (2)

• Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions
• Assortativity in random line graphs