Designing optimal structure favorable to diffusion and effectively controlling the trapping process are crucial in the study of trapping problem—random walks with a single trap. In this paper, we study the trapping problem occurring on unweighted and weighted networks, respectively. The networks under consideration display the striking scale-free, small-world, and modular properties, as observed in diverse real-world systems. For binary networks, we concentrate on three cases of trapping problems with the trap located at a peripheral node, a neighbor of the root with the least connectivity, and a farthest node, respectively. For weighted networks with edge weights controlled by a parameter, we also study three trapping problems, in which the trap is placed separately at the root, a neighbor of the root with the least degree, and a farthest node. For all the trapping problems, we obtain the analytical formulas for the average trapping time (ATT) measuring the efficiency of the trapping process, as well as the leading scaling of ATT. We show that for all the trapping problems in the binary networks with a trap located at different nodes, the dominating scalings of ATT reach the possible minimum scalings, implying that the networks have optimal structure that is advantageous to efficient trapping. Furthermore, we show that for trapping in the weighted networks, the ATT is controlled by the weight parameter, through modifying which, the ATT can behave superlinearly, linearly, sublinearly, or logarithmically with the system size. This work could help improving the design of systems with efficient trapping process and offers new insight into control of trapping in complex systems.
Skip Nav Destination
Article navigation
21 December 2013
Research Article|
December 16 2013
Random walks in unweighted and weighted modular scale-free networks with a perfect trap
Yihang Yang;
Yihang Yang
1School of Computer Science,
Fudan University
, Shanghai 200433, China
2Shanghai Key Lab of Intelligent Information Processing,
Fudan University
, Shanghai 200433, China
Search for other works by this author on:
Zhongzhi Zhang
Zhongzhi Zhang
a)
1School of Computer Science,
Fudan University
, Shanghai 200433, China
2Shanghai Key Lab of Intelligent Information Processing,
Fudan University
, Shanghai 200433, China
Search for other works by this author on:
a)
Electronic mail: zhangzz@fudan.edu.cn. URL: http://www.researcherid.com/rid/G-5522-2011
J. Chem. Phys. 139, 234106 (2013)
Article history
Received:
October 11 2013
Accepted:
November 11 2013
Citation
Yihang Yang, Zhongzhi Zhang; Random walks in unweighted and weighted modular scale-free networks with a perfect trap. J. Chem. Phys. 21 December 2013; 139 (23): 234106. https://doi.org/10.1063/1.4835655
Download citation file:
Sign in
Don't already have an account? Register
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
Pay-Per-View Access
$40.00
Citing articles via
A theory of pitch for the hydrodynamic properties of molecules, helices, and achiral swimmers at low Reynolds number
Anderson D. S. Duraes, J. Daniel Gezelter
DeePMD-kit v2: A software package for deep potential models
Jinzhe Zeng, Duo Zhang, et al.
Electronic structure simulations in the cloud computing environment
Eric J. Bylaska, Ajay Panyala, et al.
Related Content
Variational kinetic clustering of complex networks
J. Chem. Phys. (March 2023)
Anomalous behavior of trapping in extended dendrimers with a perfect trap
J. Chem. Phys. (August 2015)
Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance
Chaos (April 2014)
Controlling the efficiency of trapping in treelike fractals
J. Chem. Phys. (July 2013)