网络的谱性质和应用.pptVIP

* Application of spectra to random walks Physical Review E, 2010, 81:031118. */43 Vicsek fractals * Random walks on T fractals Physical Review E, 2010, 82:031140 */43 is obtained from the relationship between characteristic polynomials at different generations. Our method can void the computation of eigenvalues. * Random Walks on dual Sierpinski gasket */43 European Physical Journal B, 2011, 82:91-96. ? Relation to the Hanoi Towers Game What is the minimum number of moves ? * */43 The Hanoi Towers Graphs * */43 * Spectra of transition matrix: T-fractal EPL, 2011, in press */43 We obtain all the eigenvalues and their multiplicities. The reciprocal of the smallest eigenvalue is approximately equal to the mean trapping time * Spectra of transition matrix: fractal scale-free networks Completed */43 Thank You! * * * * * * * * * 复旦大学 复旦大学 复旦大学 复旦大学 复旦大学 复旦大学 复旦大学 复旦大学 Properties and applications of spectra for networks 章 忠 志 复旦大学计算机科学技术学院 Email: zhangzz@ Homepage: /~zhangzz/ Blog: /home.php?mod=spaceuid=311410 第七届全国复杂网络学术会议 Collaborators * Prof. Chen Guanrong(陈关荣), CityU of Hongkong Prof. Comellas Francesc, Universitat Politecnica de Catalunya, Barcelona, Spain Qi Yi(齐轶), Master student (graduated) Wu Shunqi(伍顺琪), Master student Wu Bin(吴斌), Master student Lin Yuan(林苑), Undergraduate student * Main contents Introduction to relevant matrices 1 Our work 2 */43 Spectral properties of various matrixes and their relevance to structure and dynamics Computation of spectra for different matrixes and their applications to network structure and random walks Definitions */45 * Adjacency matrix A Diagonal degree matrix D Laplacian matrix L=D-A Probability transition matrix Normalized Laplacian matrix Fundamental matrix Modular matrix …… Adjacency matrix */45 * From the greatest eigenvalue (often called spectrum radius), one can provide a lower bound for diameter of a network. J. Combin. Theory Ser. B 91 (1) (