报告人：林苑指导老师：忠志副教授复旦大学.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * We denote by Hg the network model after g iterations. For g=1, The network consists of a central node, called the hub node, And M-1 peripheral (external) nodes. All these M nodes are fully connected to each other. We denote by Hg the network model after g iterations. For g1, Hg can be obtained from Hg-1 by adding M-1 replicas of Hg-1 with their external nodes being linked to the hub of original Hg-1 unit. The new hub is the hub of original Hg-1 unit. The new external nodes are composed of all the peripheral nodes of M-1 copies of Hg-1. Xi First-passage time (FPT) Markov chain Define a generating function Define a generating function (Ng-1)-dimensional vector W is a matrix with order (Ng-1)*(Ng-1) with entry wij=aij/di(g) Setting z=1, Setting z=1, (I-W)-1 Fundamental matrix of the Markov chain representing the unbiased random walk For large g, inverting matrix is prohibitively time and memory consuming, making it intractable to obtain MFPT through direct calculation. Time Complexity : O(N3) Space Complexity : O(N2) Hence, an alternative method of computing MFPT becomes necessary. The larger the value of M, the more efficient the trapping process. The MFPT increases as a power-law function of the number of nodes with the exponent much less than 1. The above obtained scaling of MFPT with order of the hierarchical scale-free networks is quite different from other media. Regular lattices Fractals (Sierpinski, T-fractal…) Pseudofractal (Koch, Apollonian) More Efficient The trap is fixed on hub. The modularity. [1] Zhang Zhongzhi, Lin Yuan, et al. Trapping in scale free networks with hierarchical organization of modularity, Physical Review E, 2009, 80: 051120. [2] Zhang Zhongzhi, Lin Yuan, et al. Mean first-passage time for random walks on the T-graph, New Journal of Physics, 2009, 11: 103043. [3] Zhang Zhongzhi, Lin Yuan, et al. Average distance in a hierarchical scale-free