Scaling of average receiving time on weighted polymer networks with some topological properties

Abstract In this paper, a family of the weighted polymer networks is introduced depending on the number of copies f and a weight factor r. The topological properties of weighted polymer networks can be completely analytically characterized in terms of the involved parameters and/or of the fractal di...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Dandan Ye, Song Liu, Jia Li, Fei Zhang, Changling Han, Wei Chen, Yingze Zhang
Formato:	article
Lenguaje:	EN
Publicado:	Nature Portfolio 2017
Materias:	Medicine R Science Q
Acceso en línea:	https://doaj.org/article/2e72e0939db24f39aa77fae0f315980f
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:2e72e0939db24f39aa77fae0f315980f
record_format	dspace
spelling	oai:doaj.org-article:2e72e0939db24f39aa77fae0f315980f2021-12-02T16:08:10ZScaling of average receiving time on weighted polymer networks with some topological properties10.1038/s41598-017-02036-02045-2322https://doaj.org/article/2e72e0939db24f39aa77fae0f315980f2017-05-01T00:00:00Zhttps://doi.org/10.1038/s41598-017-02036-0https://doaj.org/toc/2045-2322Abstract In this paper, a family of the weighted polymer networks is introduced depending on the number of copies f and a weight factor r. The topological properties of weighted polymer networks can be completely analytically characterized in terms of the involved parameters and/or of the fractal dimension. Moreover, assuming that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the weight of edge linking them, namely weight-dependent walk. Then, we calculate the average receiving time (ART) with weighted-dependent walks, which is the sum of mean first-passage times (MFPTs) for all nodes absorpt at the trap located at the central node as a recursive relation. The obtained remarkable results display that when $$\frac{1}{f+1} < r < 1$$ 1 f + 1 < r < 1 , the ART grows sublinearly with the network size; when $$r=\frac{1}{f+1}$$ r = 1 f + 1 , ART grows with increasing size N g as $${\mathrm{ln}}^{2}{N}_{g}$$ ln 2 N g ; when $$0 < r < \frac{1}{f+1}$$ 0 < r < 1 f + 1 , ART grows with increasing size N g as ln N g . In the treelike polymer networks, ART grows with linearly with the network size N g when r = 1. Thus, the weighted polymer networks are more efficient than treelike polymer networks in receiving information.Dandan YeSong LiuJia LiFei ZhangChangling HanWei ChenYingze ZhangNature PortfolioarticleMedicineRScienceQENScientific Reports, Vol 7, Iss 1, Pp 1-12 (2017)
institution	DOAJ
collection	DOAJ
language	EN
topic	Medicine R Science Q
spellingShingle	Medicine R Science Q Dandan Ye Song Liu Jia Li Fei Zhang Changling Han Wei Chen Yingze Zhang Scaling of average receiving time on weighted polymer networks with some topological properties
description	Abstract In this paper, a family of the weighted polymer networks is introduced depending on the number of copies f and a weight factor r. The topological properties of weighted polymer networks can be completely analytically characterized in terms of the involved parameters and/or of the fractal dimension. Moreover, assuming that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the weight of edge linking them, namely weight-dependent walk. Then, we calculate the average receiving time (ART) with weighted-dependent walks, which is the sum of mean first-passage times (MFPTs) for all nodes absorpt at the trap located at the central node as a recursive relation. The obtained remarkable results display that when $$\frac{1}{f+1} < r < 1$$ 1 f + 1 < r < 1 , the ART grows sublinearly with the network size; when $$r=\frac{1}{f+1}$$ r = 1 f + 1 , ART grows with increasing size N g as $${\mathrm{ln}}^{2}{N}_{g}$$ ln 2 N g ; when $$0 < r < \frac{1}{f+1}$$ 0 < r < 1 f + 1 , ART grows with increasing size N g as ln N g . In the treelike polymer networks, ART grows with linearly with the network size N g when r = 1. Thus, the weighted polymer networks are more efficient than treelike polymer networks in receiving information.
format	article
author	Dandan Ye Song Liu Jia Li Fei Zhang Changling Han Wei Chen Yingze Zhang
author_facet	Dandan Ye Song Liu Jia Li Fei Zhang Changling Han Wei Chen Yingze Zhang
author_sort	Dandan Ye
title	Scaling of average receiving time on weighted polymer networks with some topological properties
title_short	Scaling of average receiving time on weighted polymer networks with some topological properties
title_full	Scaling of average receiving time on weighted polymer networks with some topological properties
title_fullStr	Scaling of average receiving time on weighted polymer networks with some topological properties
title_full_unstemmed	Scaling of average receiving time on weighted polymer networks with some topological properties
title_sort	scaling of average receiving time on weighted polymer networks with some topological properties
publisher	Nature Portfolio
publishDate	2017
url	https://doaj.org/article/2e72e0939db24f39aa77fae0f315980f
work_keys_str_mv	AT dandanye scalingofaveragereceivingtimeonweightedpolymernetworkswithsometopologicalproperties AT songliu scalingofaveragereceivingtimeonweightedpolymernetworkswithsometopologicalproperties AT jiali scalingofaveragereceivingtimeonweightedpolymernetworkswithsometopologicalproperties AT feizhang scalingofaveragereceivingtimeonweightedpolymernetworkswithsometopologicalproperties AT changlinghan scalingofaveragereceivingtimeonweightedpolymernetworkswithsometopologicalproperties AT weichen scalingofaveragereceivingtimeonweightedpolymernetworkswithsometopologicalproperties AT yingzezhang scalingofaveragereceivingtimeonweightedpolymernetworkswithsometopologicalproperties
_version_	1718384584534523904

Scaling of average receiving time on weighted polymer networks with some topological properties

Ejemplares similares