Exact scaling for the mean first-passage time of random walks on a generalized Koch network with a trap

In this paper,we study the scaling for the mean first-passage time(MFPT) of the random walks on a generalized Koch network with a trap.Through the network construction,where the initial state is transformed from a triangle to a polygon,we obtain the exact scaling for the MFPT.We show that the MFPT grows linearly with the number of nodes and the dimensions of the polygon in the large limit of the network order.In addition,we determine the exponents of scaling efficiency characterizing the random walks.Our results are the generalizations of those derived for the Koch network,which shed light on the analysis of random walks over various fractal networks.     

从一节公开课解读例题的教学

前不久,笔者应邀上了一节区级公开课<相似形专题复习>,颇感得意之处在于一道例题的教学.现将该教学片断实录如下:     

Random walks in generalized delayed recursive trees

Recently a great deal of effort has been made to explicitly determine the mean first-passage time （MFPT） between two nodes averaged over all pairs of nodes on a fractal network. In this paper, we first propose a family of generalized delayed recursive trees characterized by two parameters, where the existing nodes have a time delay to produce new nodes. We then study the MFPT of random walks on this kind of recursive tree and investigate the effect of the time delay on the MFPT. By relating random walks to electrical networks, we obtain an exact formula for the MFPT and verify it by numerical calculations. Based on the obtained results, we further show that the MFPT of delayed recursive trees is much shorter, implying that the efficiency of random walks is much higher compared with the non-delayed counterpart. Our study provides a deeper understanding of random walks on delayed fractal networks.     

改编课本例题习题让数学课鲜活起来——《解直角三角形的应用——坡度问题》教学反思

2006年5月24日,锡山区教育局组织有关专家及老师对我校新课程下的课堂教学展示活动进行评估验收.经学校推荐,我有幸向专家及同行们上了一堂公开课《解直角三角形的应用——坡度问题》.自己精心的课堂教学设计,赢得了同行们的一致好评.我谈谈自己这节课的三点设计思路.1在情景导     

Synchronization in Complex Networks with Multiple Connections

In this paper a class of networks with multiple connections are discussed. The multiple connections include two different types of links between nodes in complex networks. For this new model, we give a simple generating procedure. Furthermore, we investigate dynamical synchronization behavior in a delayed two-layer network, giving corresponding theoretical analysis and numerical examples.     

Exact scaling for the mean first-passage time of random walks on a generalized Koch network with a trap

In this paper, we study the scaling for the mean first-passage time (MFPT) of the random walks on a generalized Koch network with a trap. Through the network construction, where the initial state is transformed from a triangle to a polygon, we obtain the exact scaling for the MFPT. We show that the MFPT grows linearly with the number of nodes and the dimensions of the polygon in the large limit of the network order. In addition, we determine the exponents of scaling efficiency characterizing the random walks. Our results are the generalizations of those derived for the Koch network, which shed light on the analysis of random walks over various fractal networks.