Random walks on non-homogenous weighted Koch networks

In this paper, we introduce new models of non-homogenous weighted Koch networks on real traffic systems depending on the three scaling factors r(1); r(2); r(3) is an element of (0, 1). Inspired by the definition of the average weighted shortest path (AWSP), we define the average weighted receiving time (AWRT). Assuming that the walker, at each step, starting from its current node, moves uniformly to any of its neighbors, we show that in large network, the AWRT grows as power-law function of the network order with the exponent, represented by theta(r(1), r(2), r(3)) = log(4)(1 + r(1) + r(2) + r(3)). Moreover, the AWSP, in the infinite network order limit, only depends on the sum of scaling factors r(1), r(2), r(3). (C) 2013 AIP Publishing LLC.