Topologies and Laplacian spectra of a deterministic uniform recursive tree

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.Comment: 7 pages, 1 figures, definitive version accepted for publication in EPJ

Varieties of increasing trees

Résumé disponible dans les fichiers attaché

Giant components for two expanding graph processes

We discuss the emergence of giant components in two random graph models (one directed, one undirected). Our study of these models was motivated by an interest in finding a random model of the Internet