EconPapers    
Economics at your fingertips  
 

The trapping problem and the average shortest weighted path of the weighted pseudofractal scale-free networks

Meifeng Dai (), Changxi Dai (), Huiling Wu, Xianbin Wu (), Wenjing Feng () and Weiyi Su ()
Additional contact information
Meifeng Dai: Institute of Applied System Analysis, Jiangsu University, Zhenjiang 212013, P. R. China
Changxi Dai: Institute of Applied System Analysis, Jiangsu University, Zhenjiang 212013, P. R. China
Huiling Wu: #x2020;Junior College, Zhejiang Wanli University, Ningbo, Zhejiang 315100, P. R. China
Xianbin Wu: #x2020;Junior College, Zhejiang Wanli University, Ningbo, Zhejiang 315100, P. R. China
Wenjing Feng: Institute of Applied System Analysis, Jiangsu University, Zhenjiang 212013, P. R. China
Weiyi Su: #x2021;Department of Mathematics, Nanjing University, Nanjing 210093, P. R. China

International Journal of Modern Physics C (IJMPC), 2019, vol. 30, issue 01, 1-17

Abstract: In this paper, we study the trapping time in the weighted pseudofractal scale-free networks (WPSFNs) and the average shortest weighted path in the modified weighted pseudofractal scale-free networks (MWPSFNs) with the weight factor r. At first, for exceptional case with the trap fixed at a hub node for weight-dependent walk, we derive the exact analytic formulas of the trapping time through the structure of WPSFNs. The obtained rigorous solution shows that the trapping time approximately grows as a power-law function of the number of network nodes with the exponent represented by ln2+4r2+rln3. Then, we deduce the scaling expression of the average shortest weighted path through the iterative process of the construction of MWPSFNs. The obtained rigorous solution shows that the scalings of average shortest weighted path with network size obey three laws along with the range of the weight factor. We provide a theoretical study of the trapping time for weight-dependent walk and the average shortest weighted path in a wide range of deterministic weighted networks.

Keywords: Trapping time; average shortest weighted path; weighted pseudofractal scale-free networks; weight-dependent walk (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183119500104
Access to full text is restricted to subscribers

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:wsi:ijmpcx:v:30:y:2019:i:01:n:s0129183119500104

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183119500104

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().

 
Page updated 2025-03-20
Handle: RePEc:wsi:ijmpcx:v:30:y:2019:i:01:n:s0129183119500104