Efficiency analysis of diffusion on T-fractals in the sense of random walks

Abstract

Efficiently controlling the diffusion process is crucial in the study of diffusion problem in complex systems. In the sense of random walks with a single trap, mean trapping time(MTT) and mean diffusing time(MDT) are good measures of trapping efficiency and diffusion efficiency respectively. They both vary with the location of the node. In this paper, we study random walks on T-fractal and provided general methods to calculate the MTT for any target node and the MDT for any source node. Using the MTT and the MDT as the measure of trapping efficiency and diffusion efficiency respectively, we compare the trapping efficiency and diffusion efficiency among all nodes of T-fractal and find the best (or worst) trapping sites and the best (or worst) diffusing sites. Our results show that: the hub node of T-fractal is the best trapping site, but it is also the worst diffusing site, the three boundary nodes are the worst trapping sites, but they are also the best diffusing sites. Comparing the minimum and maximum of MTT and MDT, we found that the maximum of MTT is almost $6$ times of the minimum for MTT and the maximum of MDT is almost equal to the minimum for MDT. These results show that the location of target node has big effect on the trapping efficiency, but the location of source node almost has no effect on diffusion efficiency. We also conducted numerical simulation to test the results we have derived, the results we derived are consistent with those obtained by numerical simulation.

11 pages,6 figures. arXiv admin note: substantial text overlap with arXiv:1312.7038, arXiv:1312.7344

References in corpus (12)

• Diffusion, subdiffusion, and trapping of active particles in heterogeneous media
• Exact mean first-passage time on the T-graph
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Determining mean first-passage time on a class of treelike regular fractals
• Random walks on the Apollonian network with a single trap
• Trapping in dendrimers and regular hyperbranched polymers
• Laplacian spectra of recursive treelike small-world polymer networks: Analytical solutions and applications
• Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
• Mean first-passage time for random walks on the T-graph
• Trapping time statistics and efficiency of transport of optical excitations in dendrimers
• Trapping of Continuous-Time Quantum walks on Erdos-Renyi graphs
• Scaling of mean first-passage time as efficiency measure of nodes sending information on scale-free Koch networks

Cited by in corpus (8)

• Exact calculations of first-passage properties on the pseudofractal scale-free web
• Exact results for the first-passage properties in a class of fractal networks
• Mixed random walks with a trap in scale-free networks including nearest-neighbor and next-nearest-neighbor jumps
• 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
• Volatilities analysis of first-passage time and first-return time on a small-world scale-free network
• A Method for Geodesic Distance on Subdivision of Trees with Arbitrary Orders and Their Applications