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

► Generalize random walks on Koch networks to on weighted Koch networks. ► Average of mean first-passage time exhibits a sublinear or linear dependence on network order. ► Average weighted shortest path depends on the scaling factor in the infinite network.