Trapping time of weighted-dependent walks depending on the weight factor

Meifeng Dai, Jie Liu and Xingyi Li

Chaos, Solitons & Fractals, 2014, vol. 60, issue C, 49-55

Abstract: A weighted hierarchical network model is introduced in this paper. We study the trapping problem for weighted-dependent walks taking place on a hierarchical weighted network at a given trap. We concentrate on the average trapping time (ATT) for three cases, i.e., the immobile trap located at the root node, the external nodes and a neighbor of the root with a single connectivity, respectively. The closed-form formulae for the ATT for the three cases are obtained. In different range of the weight factor r, the leading term of ATT grows differently, i.e., superlinearly, linearly and sublinearly with the network size. For all the three cases of trapping problems, the leading scaling of ATT can reach the minimum scaling.

Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077914000150
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:60:y:2014:i:c:p:49-55

DOI: 10.1016/j.chaos.2014.01.007

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().