In this paper, we consider the average trapping time (ATT) on the weighted pseudofractal scale-free web (WPSFW) with weight factor r . According to the iteration mechanism of WPSFW, we consider the weight-dependent walk from the node of web subunit to the trap fixed in a hub node. Using the tool of probability generating function, the relationship between the mean first passage time (MFPT) of two generations of the web is discovered, and the expression of the MFPT is obtained. Moreover, we consider the MFPT averaged over all the starting nodes of subunit and finally get the analytical expression of ATT. The result shows that the ATT growth approximates a power-law function of the number of web nodes, and its exponent is ##IMG## [http://ej.iop.org/images/1742-5468/2020/4/043209/jstatab7af0ieqn1.gif] {$\frac{\mathrm{ln}\frac{4r+2}{r+2}}{\mathrm{ln}3}$} .

中文翻译：

---

加权伪分形无标度网上的平均捕获时间

在本文中，我们考虑加权因子为r的加权伪分形无标度网（WPSFW）上的平均捕获时间（ATT）。根据WPSFW的迭代机制，我们考虑了从Web子单元的节点到固定在集线器节点中的陷阱的权重相关步行。使用概率生成函数工具，发现两代网的平均第一次通过时间（MFPT）之间的关系，并获得MFPT的表达式。此外，我们考虑了在所有子单元的起始节点上平均的MFPT，最后得到了ATT的解析表达式。结果表明，ATT增长近似于Web节点数量的幂律函数，其指数为## IMG ## [http://ej.iop.org/images/1742-5468/2020/4/ 043209 / jstatab7af0ieqn1。