Controlling the efficiency of trapping in treelike fractals
arXiv:1307.0901 · doi:10.1063/1.4812690
Abstract
Efficiently controlling the trapping process, especially the trapping efficiency, is central in the study of trap problem in complex systems, since it is a fundamental mechanism for diverse other dynamic processes. Thus, it is of theoretical and practical significance to study the control technique for trapping problem. In this paper, we study the trapping problem in a family of proposed directed fractals with a deep trap at a central node. The directed fractals are a generalization of previous undirected fractals by introducing the directed edge weights dominated by a parameter. We characterize all the eigenvalues and their degeneracies for an associated matrix governing the trapping process. The eigenvalues are provided through an exact recursive relation deduced from the self-similar structure of the fractals. We also obtain the expressions for the smallest eigenvalue and the mean first-passage time (MFPT) as a measure of trapping efficiency, which is the expected time for the walker to first visit the trap. The MFPT is evaluated according to the proved fact that it is approximately equal to reciprocal of the smallest eigenvalue. We show that the MFPT is controlled by the weight parameter, by modifying which, the MFPT can scale superlinealy, linearly, or sublinearly with the system size. Thus, this work paves a way to delicately controlling the trapping process in the fractals.
arXiv commentDefinitive version accepted for publication in The Journal of Chemical Physics
References in corpus (26)
- The architecture of complex weighted networks
- First-passage times in complex scale-invariant media
- Controlling complex networks: How much energy is needed?
- Effect of correlations on network controllability
- Global mean first-passage times of random walks on complex networks
- First passage time for random walks in heterogeneous networks
- Exact mean first-passage time on the T-graph
- Exact solution for mean first-passage time on a pseudofractal scale-free web
- Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
- Random Walks on deterministic Scale-Free networks: Exact results
- Exact calculations of first-passage quantities on recursive networks
- Determining mean first-passage time on a class of treelike regular fractals
- Trapping in complex networks
- 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 random walks on the T-graph
- Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence
- Trapping time statistics and efficiency of transport of optical excitations in dendrimers
- Role of fractal dimension in random walks on scale-free networks
- Mean first-passage time for random walks in general graphs with a deep trap
- Anomalous behavior of trapping on a fractal scale-free network
- Trapping of Continuous-Time Quantum walks on Erdos-Renyi graphs
- Complete spectrum of stochastic master equation for random walks on treelike fractals
- Optimal scale-free network with a minimum scaling of transport efficiency for random walks with a perfect trap
- Random Walks on Complex Networks
Cited by in corpus (5)
- A new information dimension of complex networks
- Mean first-passage time for maximal-entropy random walks in complex networks
- Mixed random walks with a trap in scale-free networks including nearest-neighbor and next-nearest-neighbor jumps
- Random walks in unweighted and weighted modular scale-free networks with a perfect trap
- Anomalous behavior of trapping in extended dendrimers with a perfect trap