Scaling of average receiving time on double-weighted polygon networks
Abstract
In this paper, we introduce a class of double-weighted polygon networks with two different meanings of weighted factors ω and r, which represent path-difficulty and path-length, respectively, based on actual traffic networks. Picking an arbitrary node from the hub nodes set as the trap node, and the double-weighted polygon networks are divided into nt+1 blocks by combining with the iterative method. According to biased random walks, the calculation expression of average receiving time (ART) of any polygon networks is given by using the intermediate quantity the mean first-passage time (MFPT), which is applicable to any n (n≥3) polygon networks. What is more, we display the specific calculation process and results of ART of the double-weighted quadrilateral networks, indicating that ART grows exponentially with respect to the networks order and the exponent is 𝜃=log5(1+4ωr) which grows with the product of ωr. When ωr increases, ART increases linearly (ω=r=1) or sublinearly (0<ωr<1) with the size of networks, and the smaller value of ωr, the higher transportation efficiency.
| You currently do not have access to the full text article. |
|---|
