Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk

作者：Ye, Dandan; Dai, Meifeng^*; Sun, Yanqiu; Shao, Shuxiang; Xie, Qi

来源：Physica A: Statistical Mechanics and Its Applications , 2016, 458: 1-8.

DOI：10.1016/j.physa.2016.03.097

• Self-similarity
• Average receiving time
• Weighted polygon Koch network
• Weight factor
• Weight-dependent walk
• Recursive division

Based on the weighted Koch networks and the self-similarity of fractals, we present a family of weighted polygon Koch networks with a weight factor r (0 < r < 1). We study the average receiving time (ART) on weight-dependent walk (i.e., the walker moves to any of its neighbors with probability proportional to the weight of edge linking them), whose key step is to calculate the sum of mean first-passage times (MFPTs) for all nodes absorpt at a hub node. We use a recursive division method to divide the weighted polygon Koch networks in order to calculate the ART scaling more conveniently. We show that the ART scaling exhibits a sublinear or linear dependence on network order. Thus, the weighted polygon Koch networks are more efficient than expended Koch networks in receiving information. Finally, compared with other previous studies' results (i.e., Koch networks, weighted Koch networks), we find out that our models are more general.

• 出版日期2016-9-15
• 单位江苏大学