Eigenvalues of transition weight matrix for a family of weighted networks

Abstract

In this article, we design a family of scale-free networks and study its random target access time and weighted spanning trees through the eigenvalues of transition weight matrix. First, we build a type of fractal network with a weight factor rr and a parameter mm. Then, we obtain all the eigenvalues of its transition weight matrix by revealing the recursive relationship between eigenvalues in every two consecutive time steps and obtain the multiplicities corresponding to these eigenvalues. Furthermore, we provide a closed-form expression of the random target access time for the network studied. The obtained results show that the random target access is not affected by the weight; it is only affected by parameters mm and tt. Finally, we also enumerate the weighted spanning trees of the studied networks through the obtained eigenvalues.

Keywords

• laplacian eigenvalue
• weighted network
• random walk
• random target access time
• weighted spanning tree
• 05c81