EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS.

In this paper, we construct a class of weighted fractal scale-free hierarchical-lattice networks. Each edge in the network generates q connected branches in each iteration process and assigns the corresponding weight. To reflect the global characteristics of such networks, we study the eigentime identity determined by the reciprocal sum of non-zero eigenvalues of normalized Laplacian matrix. By the recursive relationship of eigenvalues at two successive generations, we find the eigenvalues and their corresponding multiplicities for two cases when q is even or odd. Finally, we obtain the analytical expression of the eigentime identity and the scalings with network size of the weighted scale-free networks. [ABSTRACT FROM AUTHOR]