1、Random walks in complex networks 第六届全国网络科学论坛与第二届全国混沌应用研讨会章 忠 志复旦大学计算科学技术学院Email: Homepage: http:/ 7月 26-31日复旦大学Brief introduction to our groupWhat is a random walkImportant parameter of random walksApplications of random walksOur work on Random walks: trapping in complex networksContents2复旦大学Brief i
2、ntroduction to our groupv Research directions: structure and dynamics in networks Modeling networks and Structural analysis Spectrum analysis and its application Enumeration problems: spanning trees, perfect matching, Hamilton paths Dynamics: Random walks, percolation3复旦大学-Random Walks on Graphs 4复旦
3、大学Random Walks on Graphs vAt any node, go to one of the neighbors of the node with equal probability.-5复旦大学Random Walks on Graphs vAt any node, go to one of the neighbors of the node with equal probability.-6复旦大学Random Walks on Graphs vAt any node, go to one of the neighbors of the node with equal p
4、robability.-7复旦大学Random Walks on Graphs vAt any node, go to one of the neighbors of the node with equal probability.-8复旦大学Random Walks on Graphs vAt any node, go to one of the neighbors of the node with equal probability.-9复旦大学Important parameters of random walks重要指标Mean Commute time C(s,t): Steps from i to j, and then go back C(t,s) = F(s,t) + F(t,s)Mean Return time T(s,s): mean time for returning to node s for the first time after having left itFirst-Passage Time F(s,t): Expected number of steps to reach t starting at sCover time, survival problity, New J. Phys. 7, 26 (2005)10
