Mean Weighted First-passage Time On Three Classes Of Double-weighted Networks

In this dissertation, we mainly study the average weighted receiving time of the hub node on the homogeneous double-weighted Koch networks, the average weighted receiving time of the central node on the non-homogeneous double-weighted fractal networks, and the average weighted trapping time on the node- and edge-weighted fractal networks.In Chapter 1, we introduce the development processes and the basic concepts of complex networks and weighted networks. Then we introduce some biased walks on the weighted networks and two kinds of special networks.In Chapter 2, the homogeneous double-weighted Koch networks is introduced and an important performance indicator- the average weighted receiving time measuring the efficiency of information transmission on the network is studied.Finally, the specific analytical of the average weighted receiving time is obtained.In Chapter 3, we focus on a kind of the non-homogeneous double-weighted fractal networks and study the average weighted receiving time of the network. The study shows that the average weighted receiving time of the network depends on two kinds of weight factors sirw),,2,1(,ii??, and grows with sub-linearly or linearly with the network size.In Chapter 4, we investigate the node- and edge-weighted fractal networks and study the structure characteristics of the network. When the immobile trap is located at the central node, we derive the exact analytic formulas of the average weighted trapping time of node-weight-dependent walk on it, in terms of the number of copies,node-weight factor and edge-weight factor.