TRAPPING ON WEIGHTED TETRAHEDRON KOCH NETWORKS WITH SMALL-WORLD PROPERTY

Abstract

In this paper, we present weighted tetrahedron Koch networks depending on a weight factor. According to their self-similar construction, we obtain the analytical expressions of the weighted clustering coefficient and average weighted shortest path (AWSP). The obtained solutions show that the weighted tetrahedron Koch networks exhibits small-world property. Then, we calculate the average receiving time (ART) on weighted-dependent walks, which is the sum of mean first-passage times (MFPTs) for all nodes absorpt at the trap located at a hub node. We find that the ART exhibits a sublinear or linear dependence on network order.