Two types of weight-dependent walks with a trap in weighted scale-free treelike networks

Abstract In this paper, we present the weighted scale-free treelike networks controlled by the weight factor r and the parameter m. Based on the network structure, we study two types of weight-dependent walks with a highest-degree trap. One is standard weight-dependent walk, while the other is mixed...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Meifeng Dai, Yue Zong, Jiaojiao He, Xiaoqian Wang, Yu Sun, Weiyi Su
Formato:	article
Lenguaje:	EN
Publicado:	Nature Portfolio 2018
Materias:	Medicine R Science Q
Acceso en línea:	https://doaj.org/article/d97c235ef7064380955eafa8007401fe
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:d97c235ef7064380955eafa8007401fe
record_format	dspace
spelling	oai:doaj.org-article:d97c235ef7064380955eafa8007401fe2021-12-02T15:08:49ZTwo types of weight-dependent walks with a trap in weighted scale-free treelike networks10.1038/s41598-018-19959-x2045-2322https://doaj.org/article/d97c235ef7064380955eafa8007401fe2018-01-01T00:00:00Zhttps://doi.org/10.1038/s41598-018-19959-xhttps://doaj.org/toc/2045-2322Abstract In this paper, we present the weighted scale-free treelike networks controlled by the weight factor r and the parameter m. Based on the network structure, we study two types of weight-dependent walks with a highest-degree trap. One is standard weight-dependent walk, while the other is mixed weight-dependent walk including both nearest-neighbor and next-nearest-neighbor jumps. Although some properties have been revealed in weighted networks, studies on mixed weight-dependent walks are still less and remain a challenge. For the weighted scale-free treelike network, we derive exact solutions of the average trapping time (ATT) measuring the efficiency of the trapping process. The obtained results show that ATT is related to weight factor r, parameter m and spectral dimension of the weighted network. We find that 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. Furthermore, the obtained results show that changing the walking rule has no effect on the leading scaling of the trapping efficiency. All results in this paper can help us get deeper understanding about the effect of link weight, network structure and the walking rule on the properties and functions of complex networks.Meifeng DaiYue ZongJiaojiao HeXiaoqian WangYu SunWeiyi SuNature PortfolioarticleMedicineRScienceQENScientific Reports, Vol 8, Iss 1, Pp 1-11 (2018)
institution	DOAJ
collection	DOAJ
language	EN
topic	Medicine R Science Q
spellingShingle	Medicine R Science Q Meifeng Dai Yue Zong Jiaojiao He Xiaoqian Wang Yu Sun Weiyi Su Two types of weight-dependent walks with a trap in weighted scale-free treelike networks
description	Abstract In this paper, we present the weighted scale-free treelike networks controlled by the weight factor r and the parameter m. Based on the network structure, we study two types of weight-dependent walks with a highest-degree trap. One is standard weight-dependent walk, while the other is mixed weight-dependent walk including both nearest-neighbor and next-nearest-neighbor jumps. Although some properties have been revealed in weighted networks, studies on mixed weight-dependent walks are still less and remain a challenge. For the weighted scale-free treelike network, we derive exact solutions of the average trapping time (ATT) measuring the efficiency of the trapping process. The obtained results show that ATT is related to weight factor r, parameter m and spectral dimension of the weighted network. We find that 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. Furthermore, the obtained results show that changing the walking rule has no effect on the leading scaling of the trapping efficiency. All results in this paper can help us get deeper understanding about the effect of link weight, network structure and the walking rule on the properties and functions of complex networks.
format	article
author	Meifeng Dai Yue Zong Jiaojiao He Xiaoqian Wang Yu Sun Weiyi Su
author_facet	Meifeng Dai Yue Zong Jiaojiao He Xiaoqian Wang Yu Sun Weiyi Su
author_sort	Meifeng Dai
title	Two types of weight-dependent walks with a trap in weighted scale-free treelike networks
title_short	Two types of weight-dependent walks with a trap in weighted scale-free treelike networks
title_full	Two types of weight-dependent walks with a trap in weighted scale-free treelike networks
title_fullStr	Two types of weight-dependent walks with a trap in weighted scale-free treelike networks
title_full_unstemmed	Two types of weight-dependent walks with a trap in weighted scale-free treelike networks
title_sort	two types of weight-dependent walks with a trap in weighted scale-free treelike networks
publisher	Nature Portfolio
publishDate	2018
url	https://doaj.org/article/d97c235ef7064380955eafa8007401fe
work_keys_str_mv	AT meifengdai twotypesofweightdependentwalkswithatrapinweightedscalefreetreelikenetworks AT yuezong twotypesofweightdependentwalkswithatrapinweightedscalefreetreelikenetworks AT jiaojiaohe twotypesofweightdependentwalkswithatrapinweightedscalefreetreelikenetworks AT xiaoqianwang twotypesofweightdependentwalkswithatrapinweightedscalefreetreelikenetworks AT yusun twotypesofweightdependentwalkswithatrapinweightedscalefreetreelikenetworks AT weiyisu twotypesofweightdependentwalkswithatrapinweightedscalefreetreelikenetworks
_version_	1718388030864097280

Two types of weight-dependent walks with a trap in weighted scale-free treelike networks

Ejemplares similares