The mean weighted first-passage time of the weighted networks with the random walk-戴美凤 (江苏大学)

来源:澳门尼威斯人网站8311点击数:954更新时间:2018-06-11

主  题:The mean weighted first-passage time of the weighted networks with the random walk

内容简介:Based on the weighted networks and the self-similarity of fractals, we present some kinds of weighted networks. To explore the effect of the underlying structures, the number of copies, node weights and edge weights on the trapping efficiency, we study the trapping problem in these networks with the underlying geometries, focusing on a particular case with a perfect trap fixed at a given position. A basic quantity relevant to the trapping problem is the weighted trapping time(WTT), commonly called the mean weighted first-passage time(MWFPT). The average weighted trapping time(AWTT) is the average of weighted trapping time over all starting nodes other than the trap node. We use a recursive division method to divide these networks in order to calculate the AWTT scaling. We derive exactly the AWTT formulas and scalings of these networks. We show that the AWTT scaling exhibits a sublinear or linear dependence on network size. Finally, in weighted networks, adjusting the weight factor can profoundly affect the efficiency of random walk on the network.

报告人:戴美凤    教授    

时  间:2018-06-13    10:00

地  点:竞慧东楼302

举办单位:统计与数学学院  澄园书院


澳门尼威斯人网站8311版权所有 苏ICP备05007120号-4

江苏省南京市浦口区江浦街道雨山西路86号

邮编:211815

返回原图
/

XML 地图 | Sitemap 地图