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.

arXiv commentDefinitive version published in Journal of Physics A: Mathematical and Theoretical

References in corpus (50)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• Epidemic spreading in scale-free networks
• Assortative mixing in networks
• Synchronization in complex networks
• Evolution of networks
• Specificity and stability in topology of protein networks
• Evolutionary games on graphs
• Who is the best connected scientist? A study of scientific coauthorship networks
• Network robustness and fragility: Percolation on random graphs
• Characterization of complex networks: A survey of measurements
• Critical phenomena in complex networks
• Hierarchical Organization in Complex Networks
• Synchronization in small-world systems
• Dynamical and correlation properties of the Internet
• Breakdown of the Internet under intentional attack
• Large-scale topological and dynamical properties of Internet
• Betweenness Centrality in Large Complex Networks
• Absence of epidemic threshold in scale-free networks with connectivity correlations
• Pseudofractal Scale-free Web
• Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
• Deterministic Scale-Free Networks
• Classification of scale-free networks
• Spectra of complex networks
• Spectra and eigenvectors of scale-free networks
• A Geometric Fractal Growth Model for Scale Free Networks
• A deterministic small-world network created by edge iterations
• Recursive graphs with small-world scale-free properties
• Synchronization in large directed networks of coupled phase oscillators
• Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
• Shortest paths and load scaling in scale-free trees
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Evolving Apollonian Networks with Small-world Scale-free topologies
• A general geometric growth model for pseudofractal scale-free web
• Hierarchical, Regular Small-World Networks
• Evolving small-world networks with geographical attachment preference
• 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
• Degree-dependent intervertex separation in complex networks
• Correlations in random Apollonian network
• Topologies and Laplacian spectra of a deterministic uniform recursive tree
• Recursive weighted treelike networks
• 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 (5)

• Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
• Random walks in small-world exponential treelike networks
• Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions
• Assortativity in random line graphs
• Deterministic simplicial complexes