Mean trapping time for an arbitrary node on regular hyperbranched polymers

Abstract

The regular hyperbranched polymers (RHPs), also known as Vicsek fractals, are an important family of hyperbranched structures which have attracted a wide spread attention during the past several years. In this paper, we study the first-passage properties for random walks on the RHPs. Firstly, we propose a way to label all the different nodes of the RHPs and derive exact formulas to calculate the mean first-passage time (MFPT) between any two nodes and the mean trapping time (MTT) for any trap node. Then, we compare the trapping efficiency between any two nodes of the RHPs by using the MTT as the measures of trapping efficiency. We find that the central node of the RHPs is the best trapping site and the nodes which are the farthest nodes from the central node are the worst trapping sites. Furthermore, we find that the maximum of the MTT is about $4$ times more than the minimum of the MTT. The result is similar to the results in the recursive fractal scale-free trees and T-fractal, but it is quite different from that in the recursive non-fractal scale-free trees. These results can help understanding the influences of the topological properties and trap location on the trapping efficiency.

19 pages, 4 figures

References in corpus (17)

• Geometry-controlled kinetics
• Diffusion, subdiffusion, and trapping of active particles in heterogeneous media
• First passages in bounded domains: When is the mean first passage time meaningful?
• Exact mean first-passage time on the T-graph
• Random Walks on deterministic Scale-Free networks: Exact results
• Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices
• Exact calculations of first-passage quantities on recursive networks
• Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
• Random walks on the Apollonian network with a single trap
• Trapping in dendrimers and regular hyperbranched polymers
• Effective target arrangement in a deterministic scale-free graph
• Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
• Mean first-passage time for maximal-entropy random walks in complex networks
• Efficiency analysis of diffusion on T-fractals in the sense of random walks
• Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees
• Maximal entropy random walk improves efficiency of trapping in dendrimers
• Mean trapping time for an arbitrary node on regular hyperbranched polymers

Cited by in corpus (5)

• Exact results for the first-passage properties in a class of fractal networks
• First encounters on Bethe Lattices and Cayley Trees
• Mean trapping time for an arbitrary node on regular hyperbranched polymers
• Analysis of fluctuations in the first return times of random walks on regular branched networks
• Anomalous behavior of trapping in extended dendrimers with a perfect trap