Scaling of average receiving time and average weighted shortest path on weighted Koch networks

详细信息    查看全文

• 作者：Meifeng Dai ; D ; an Chen ; Yujuan Dong ; Jie Liu
• 关键词：Weighted Koch network ; Transportation efficiency ; Average receiving time ; Average weighted shortest path
• 刊名：Physica A
• 出版年：2012
• 出版时间：1 December, 2012
• 年：2012
• 卷：391
• 期：23
• 页码：6165-6173
• 全文大小：617 K

文摘

In this paper we present weighted Koch networks based on classic Koch networks. A new method is used to determine the average receiving time (ART), whose key step is to write the sum of mean first-passage times (MFPTs) for all nodes to absorption at the trap located at a hub node as a recursive relation. We show that the ART exhibits a sublinear or linear dependence on network order. Thus, the weighted Koch networks are more efficient than classic Koch networks in receiving information. Moreover, average weighted shortest path (AWSP) is calculated. In the infinite network order limit, the AWSP depends on the scaling factor. The weighted Koch network grows unbounded but with the logarithm of the network size, while the weighted shortest paths stay bounded.