Cargando…
The entire mean weighted first-passage time on a family of weighted treelike networks
In this paper, we consider the entire mean weighted first-passage time (EMWFPT) with random walks on a family of weighted treelike networks. The EMWFPT on weighted networks is proposed for the first time in the literatures. The dominating terms of the EMWFPT obtained by the following two methods are...
Autores principales: | , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4928076/ https://www.ncbi.nlm.nih.gov/pubmed/27357233 http://dx.doi.org/10.1038/srep28733 |
_version_ | 1782440372236976128 |
---|---|
author | Dai, Meifeng Sun, Yanqiu Sun, Yu Xi, Lifeng Shao, Shuxiang |
author_facet | Dai, Meifeng Sun, Yanqiu Sun, Yu Xi, Lifeng Shao, Shuxiang |
author_sort | Dai, Meifeng |
collection | PubMed |
description | In this paper, we consider the entire mean weighted first-passage time (EMWFPT) with random walks on a family of weighted treelike networks. The EMWFPT on weighted networks is proposed for the first time in the literatures. The dominating terms of the EMWFPT obtained by the following two methods are coincident. On the one hand, using the construction algorithm, we calculate the receiving and sending times for the central node to obtain the asymptotic behavior of the EMWFPT. On the other hand, applying the relationship equation between the EMWFPT and the average weighted shortest path, we also obtain the asymptotic behavior of the EMWFPT. The obtained results show that the effective resistance is equal to the weighted shortest path between two nodes. And the dominating term of the EMWFPT scales linearly with network size in large network. |
format | Online Article Text |
id | pubmed-4928076 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2016 |
publisher | Nature Publishing Group |
record_format | MEDLINE/PubMed |
spelling | pubmed-49280762016-07-01 The entire mean weighted first-passage time on a family of weighted treelike networks Dai, Meifeng Sun, Yanqiu Sun, Yu Xi, Lifeng Shao, Shuxiang Sci Rep Article In this paper, we consider the entire mean weighted first-passage time (EMWFPT) with random walks on a family of weighted treelike networks. The EMWFPT on weighted networks is proposed for the first time in the literatures. The dominating terms of the EMWFPT obtained by the following two methods are coincident. On the one hand, using the construction algorithm, we calculate the receiving and sending times for the central node to obtain the asymptotic behavior of the EMWFPT. On the other hand, applying the relationship equation between the EMWFPT and the average weighted shortest path, we also obtain the asymptotic behavior of the EMWFPT. The obtained results show that the effective resistance is equal to the weighted shortest path between two nodes. And the dominating term of the EMWFPT scales linearly with network size in large network. Nature Publishing Group 2016-06-30 /pmc/articles/PMC4928076/ /pubmed/27357233 http://dx.doi.org/10.1038/srep28733 Text en Copyright © 2016, Macmillan Publishers Limited http://creativecommons.org/licenses/by/4.0/ This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/ |
spellingShingle | Article Dai, Meifeng Sun, Yanqiu Sun, Yu Xi, Lifeng Shao, Shuxiang The entire mean weighted first-passage time on a family of weighted treelike networks |
title | The entire mean weighted first-passage time on a family of weighted treelike networks |
title_full | The entire mean weighted first-passage time on a family of weighted treelike networks |
title_fullStr | The entire mean weighted first-passage time on a family of weighted treelike networks |
title_full_unstemmed | The entire mean weighted first-passage time on a family of weighted treelike networks |
title_short | The entire mean weighted first-passage time on a family of weighted treelike networks |
title_sort | entire mean weighted first-passage time on a family of weighted treelike networks |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4928076/ https://www.ncbi.nlm.nih.gov/pubmed/27357233 http://dx.doi.org/10.1038/srep28733 |
work_keys_str_mv | AT daimeifeng theentiremeanweightedfirstpassagetimeonafamilyofweightedtreelikenetworks AT sunyanqiu theentiremeanweightedfirstpassagetimeonafamilyofweightedtreelikenetworks AT sunyu theentiremeanweightedfirstpassagetimeonafamilyofweightedtreelikenetworks AT xilifeng theentiremeanweightedfirstpassagetimeonafamilyofweightedtreelikenetworks AT shaoshuxiang theentiremeanweightedfirstpassagetimeonafamilyofweightedtreelikenetworks AT daimeifeng entiremeanweightedfirstpassagetimeonafamilyofweightedtreelikenetworks AT sunyanqiu entiremeanweightedfirstpassagetimeonafamilyofweightedtreelikenetworks AT sunyu entiremeanweightedfirstpassagetimeonafamilyofweightedtreelikenetworks AT xilifeng entiremeanweightedfirstpassagetimeonafamilyofweightedtreelikenetworks AT shaoshuxiang entiremeanweightedfirstpassagetimeonafamilyofweightedtreelikenetworks |