Mean-field theory for scale-free random networks：（平均场理论无尺度随机网络）.pdfVIP

Mean-field theory for scale-free random networks 9 9 9 1 l Albert-L´aszl´o Barab´asi, 1 R´eka Albert, Hawoong Jeong u J 5 Department of Physics, University of Notre-Dame, Notre-Dame, IN 46556, USA ] n n - s Abstract i d t. Random networks with complex topology are common in Nature, describing systems a as diverse as the world wide web or social and business networks. Recently, it has m been demonstrated that most large networks for which topological information is - d available display scale-free features. Here we study the scaling properties of the n recently introduced scale-free model, that can account for the observed power-law o distribution of the connectivities. We develop a mean-field method to predict the c [ growth dynamics of the individual vertices, and use this to calculate analytically 1 the connectivity distribution and the scaling exponents. The mean-field method can v be used to address the properties of two variants of the scale-free model, that do 8 not display power-law scaling. 6 0 7 0 PACS: 9 9 / Key words: disordered systems, networks, random networks, critical phenomena, t a scaling m - d n o c : v 1 Introduction i X r a Contemporary science has been particularly successful in addressing the phys- ical properties of systems that are composed of many identical elements in- teracting through mainly local interactions. For example, many successes of materials science and solid state physics are based on the fact that