复杂网络上的传播和耦合动力学过程研究
|
摘要
复杂网络是近年来兴起的一门新兴交叉学科,由于其研究对象的普遍性和多样性,受到国内外众多学科研究人员的广泛关注。在我们周围,网络无处不在,遍及自然界和人类社会。任何一个复杂系统都可以抽象成为由相互作用的个体组成的网络,其中个体抽象为网络节点,个体间的相互作用抽象为网络连边。其中广为人们熟知并具有代表性的网络包括互联网、万维网、铁路网、航空网、电力网、蛋白质相互作用网、新陈代谢网、基因调控网、神经网、人际关系网等等。深入研究这些网络不仅对人们的工作和生活具有现实意义,而且对了解自然界和社会的发展具有深远的科学和社会意义。
复杂网络研究关注个体之间的微观相互作用导致的系统的宏观现象。和传统还原论方法不同,复杂网络把整个系统作为研究对象,专注于系统中个体的相互作用,预言复杂系统丰富的整体行为,包括自组织特性,涌现等。在科学高度发展的今天,以整体的、网络的观点研究各种复杂现象已经成为科学研究的必然趋势。复杂网络的研究已经渗透到自然科学和社会科学的各个方面,突破了学科之间界限,极大地推动了数学、物理、化学、生物学、信息工程和其它社会科学等多学科的交叉和发展。因此,复杂网络研究具有重大的理论价值。
研究复杂网络的最终目标是理解网络结构如何影响发生于网络上的各种动力学过程。网络上的信息传播和网络上的耦合现象研究是其中非常重要的研究内容。文献中大量的传播动力学和网络同步的论文,包括网络上的病毒传播、信息传播、博弈过程和同步现象等,从各自不同的角度研究复杂系统的特性。根据当前国内外复杂网络的研究动态和发展趋势,我们在网络上的信息流传播和网络的耦合同步现象的动力学过程方面做了比较系统的工作,本文的主要工作如下:
比较系统地研究了无标度网络上的信息传播动力学,首次提出了基于局域拓扑信息路由策略的概念。随着互联网等大型通讯网络的广泛应用,网络规模变得越来越庞大,网络结构也越来越复杂,网络拥塞变得越来越普遍,特别是网络的拓扑结构也在不断的变化之中,这使得基于网络全局拓扑信息的传统路由策略遭受日益紧迫的存储和计算能力的压力。不同于过去的基于网络全局拓扑信息的数据包路由规则,我们提出了基于局域拓扑信息的数据包路由规则,研究了系统中信息流从自由流态到阻塞流态的相变特性,并以此特性为标准来刻画网络的总体通讯能力;研究了这些算法的各种时间和空间特性。我们还发现适当地增加网络结构的拓扑信息量,比如考虑网络节点次近邻信息,可以极大地提高通讯网络的总体通讯能力。在实际设计网络路由算法时可以在开销和性能之间取舍,以便可以获得一个最优的解决方案。我们的研究对于目前网络路由协议算法的优化以及新一代路由协议的设计有一定的指导意义。相关的研究论文发表在Physical Review E、European Physics Journal B、Physics LettersA等杂志上。
研究了无标度网络上的同步,提出通过去耦合过程来提高网络的同步能力。我们从网络体系拓扑结构出发,对网络结构作一个微扰,研究了网络的特征参量,如平均最短距离、网络的最大介数等参量,对网络同步能力的影响,发现网络的最大介数和网络同步能力存在某种线性关系,因而网络的最大介数在某种情况下(比如网络结构相似),是表征网络同步能力大小的一个最适宜的参量。由于该方法简单易行,在工程实践中可能有很大的潜在应用价值,相关的研究论文发表在Physical Review E上。
此外,我们研究了地理约束因素对小世界网络上的同步现象影响。实际的网络很多都是嵌入到一定的空间里的,即网络中的节点占据着一维、二维或者三维空间的一个确定的位置,它们的连边是某种实际的相互作用。典型的实例包括神经网络、信息通讯网络、电力网络、交通网络(包括河流、机场、街道、铁路和公路)等等。我们研究了一维和二维格子上由于地理约束所引起的耦合强度变化对网络同步能力的影响,发现网络的同步能力不仅和空间距离而且和耦合强度都不是一个平凡的关系。我们的研究表明,空间距离的限制在网络的集体同步过程中起到非常重要的作用。由于这类网络在国民经济和人民生活中占据着十分重要的位置,对它们的研究不但是必要的而且是必须的,相关的研究论文发表在Physical Review E上。
我们发现网络上的信息传播和网络的耦合同步存在内在的联系,通讯性能表现良好的网络,其网络的同步能力也同样比较强。我们分析了网络上信息传播和同步的关系,同步的过程同时也是耦合信息传播的过程。因此这两个看似无关的研究课题,本质上是相关的过程,分别从不同的方面反映了网络拓扑结构的影响。
Complex network modeling has been considered as an important interdiscipline approach for describing and understanding complex systems.Because of universality and diversity of its research objects,it has attracted broad attentions of researchers in many fields all over the world.Complex networks are ubiquitous around our lives, ranging from nature to human socity.Any complex network system can be viewed as a graph of interacted individuals,where nodes denote individuals and links denote interactions between them.The well-known and extensively studied networks include Internet,World Wide Web,railway networks,airport networks,the power grid,proteinprotein interaction networks,metabolic networks,gene regulatory networks,neuron networks,human relationship networks,etc.Extensive researches of these networks in the past a few years have completely changed the traditional view about the real world networks and spurred the rapid development of the interdisciplinary scientific fields.
Complex network modeling approach focus on macroscopical phenomena result from the interactions of individuals.Apart from traditional reductionism usually used by physicists,by complex network modeling approach point of view,the investigating system is seen as a whole,the interactions of individuals inside the system are focused on and rich overall behaviors of the system are predicted including self-organised properties, emergence and other phenomena.So far,the investigation of complex networks has covered many fields,including mathmatics,physics,chemistry,biology,technology and social sciences.
The ultimate goal of studying complex networks is to understand how topological properties affect the dynamical processes taking place on them.Researches on information propagation and coupling phenomena over complex networks are of the greatest importance.There are many papers concerning propagation dynamics and synchronization over complex networks in the literature,including epidemic spreading, information propagation,game,synchronization and so on.Inspired by the current international research interests,we focused on the information propagation dynamics and synchronization phenomena over the complex networks.The works we do in these fields are following:
We have systematically investigated the dynamics of information propagation over scale-free networks.Because the sizes of modern communication networks are becoming bigger and bigger,even worse,the topology of the networks is everchanging,the traditional routing strategies,which based on the global topological information,suffer lack of storage and computational power.Considering this situation,we have proposed several routing strategies of sending data packets only based on local information.We can quantify the capacity of a network by the phase transition from free flow state to congestion state,and we have found the optimal parameter values,resulting in the highest efficiency of scale-free networks.Moreover,we found appropriately increasing information of network topology can greatly increase the capacity of the network,for example,next nearest-neighbor searching strategy.In the practical design of the routing strategy,we can trade off cost against capability of the system in order to find an optimal solution.Our results may be useful for designing next generation routing protocol.
We have studied the collective synchronization behavior over scale-free networks and proposed a decoupling process to enhance the synchronizability of scale-free networks. With perturbation on the network structure,we investigated how th characteristic parameters,for example the average shortest path,the maximum betweenness and so on,affect the synchronizability of the networks.We find that the maximum betweenness have a linear-like relation with synchronizability of the network.The results indicate that the maximum betweenness is a best token of network synchronizability among similar network structure so far.
We also investigated geographical effect on small-world network synchronization. Many real world networks are embeded in some specific space,nodes have coordinets and links denote some real interactions.We have explored the effects of coupling strength, which coming from geographical restriction,on network synchronizability on one- and two- dimensional lattices.It is found that network synchronizability is a nontrivial function of distance and coupling strength.Our findings shed some light on the collective dynamics of real coupled systems.
We find information propagation on a complex network have some relations with synchronization on the network:Networks with high system capacity often show high network synchronizability.Actually,synchronization process is also a process of transmission of coupling information.The two seemingly irrelevant research subjects have the same underlying dynamical nature,reflecting different aspects of the properties of the system.
复杂网络研究关注个体之间的微观相互作用导致的系统的宏观现象。和传统还原论方法不同,复杂网络把整个系统作为研究对象,专注于系统中个体的相互作用,预言复杂系统丰富的整体行为,包括自组织特性,涌现等。在科学高度发展的今天,以整体的、网络的观点研究各种复杂现象已经成为科学研究的必然趋势。复杂网络的研究已经渗透到自然科学和社会科学的各个方面,突破了学科之间界限,极大地推动了数学、物理、化学、生物学、信息工程和其它社会科学等多学科的交叉和发展。因此,复杂网络研究具有重大的理论价值。
研究复杂网络的最终目标是理解网络结构如何影响发生于网络上的各种动力学过程。网络上的信息传播和网络上的耦合现象研究是其中非常重要的研究内容。文献中大量的传播动力学和网络同步的论文,包括网络上的病毒传播、信息传播、博弈过程和同步现象等,从各自不同的角度研究复杂系统的特性。根据当前国内外复杂网络的研究动态和发展趋势,我们在网络上的信息流传播和网络的耦合同步现象的动力学过程方面做了比较系统的工作,本文的主要工作如下:
比较系统地研究了无标度网络上的信息传播动力学,首次提出了基于局域拓扑信息路由策略的概念。随着互联网等大型通讯网络的广泛应用,网络规模变得越来越庞大,网络结构也越来越复杂,网络拥塞变得越来越普遍,特别是网络的拓扑结构也在不断的变化之中,这使得基于网络全局拓扑信息的传统路由策略遭受日益紧迫的存储和计算能力的压力。不同于过去的基于网络全局拓扑信息的数据包路由规则,我们提出了基于局域拓扑信息的数据包路由规则,研究了系统中信息流从自由流态到阻塞流态的相变特性,并以此特性为标准来刻画网络的总体通讯能力;研究了这些算法的各种时间和空间特性。我们还发现适当地增加网络结构的拓扑信息量,比如考虑网络节点次近邻信息,可以极大地提高通讯网络的总体通讯能力。在实际设计网络路由算法时可以在开销和性能之间取舍,以便可以获得一个最优的解决方案。我们的研究对于目前网络路由协议算法的优化以及新一代路由协议的设计有一定的指导意义。相关的研究论文发表在Physical Review E、European Physics Journal B、Physics LettersA等杂志上。
研究了无标度网络上的同步,提出通过去耦合过程来提高网络的同步能力。我们从网络体系拓扑结构出发,对网络结构作一个微扰,研究了网络的特征参量,如平均最短距离、网络的最大介数等参量,对网络同步能力的影响,发现网络的最大介数和网络同步能力存在某种线性关系,因而网络的最大介数在某种情况下(比如网络结构相似),是表征网络同步能力大小的一个最适宜的参量。由于该方法简单易行,在工程实践中可能有很大的潜在应用价值,相关的研究论文发表在Physical Review E上。
此外,我们研究了地理约束因素对小世界网络上的同步现象影响。实际的网络很多都是嵌入到一定的空间里的,即网络中的节点占据着一维、二维或者三维空间的一个确定的位置,它们的连边是某种实际的相互作用。典型的实例包括神经网络、信息通讯网络、电力网络、交通网络(包括河流、机场、街道、铁路和公路)等等。我们研究了一维和二维格子上由于地理约束所引起的耦合强度变化对网络同步能力的影响,发现网络的同步能力不仅和空间距离而且和耦合强度都不是一个平凡的关系。我们的研究表明,空间距离的限制在网络的集体同步过程中起到非常重要的作用。由于这类网络在国民经济和人民生活中占据着十分重要的位置,对它们的研究不但是必要的而且是必须的,相关的研究论文发表在Physical Review E上。
我们发现网络上的信息传播和网络的耦合同步存在内在的联系,通讯性能表现良好的网络,其网络的同步能力也同样比较强。我们分析了网络上信息传播和同步的关系,同步的过程同时也是耦合信息传播的过程。因此这两个看似无关的研究课题,本质上是相关的过程,分别从不同的方面反映了网络拓扑结构的影响。
Complex network modeling has been considered as an important interdiscipline approach for describing and understanding complex systems.Because of universality and diversity of its research objects,it has attracted broad attentions of researchers in many fields all over the world.Complex networks are ubiquitous around our lives, ranging from nature to human socity.Any complex network system can be viewed as a graph of interacted individuals,where nodes denote individuals and links denote interactions between them.The well-known and extensively studied networks include Internet,World Wide Web,railway networks,airport networks,the power grid,proteinprotein interaction networks,metabolic networks,gene regulatory networks,neuron networks,human relationship networks,etc.Extensive researches of these networks in the past a few years have completely changed the traditional view about the real world networks and spurred the rapid development of the interdisciplinary scientific fields.
Complex network modeling approach focus on macroscopical phenomena result from the interactions of individuals.Apart from traditional reductionism usually used by physicists,by complex network modeling approach point of view,the investigating system is seen as a whole,the interactions of individuals inside the system are focused on and rich overall behaviors of the system are predicted including self-organised properties, emergence and other phenomena.So far,the investigation of complex networks has covered many fields,including mathmatics,physics,chemistry,biology,technology and social sciences.
The ultimate goal of studying complex networks is to understand how topological properties affect the dynamical processes taking place on them.Researches on information propagation and coupling phenomena over complex networks are of the greatest importance.There are many papers concerning propagation dynamics and synchronization over complex networks in the literature,including epidemic spreading, information propagation,game,synchronization and so on.Inspired by the current international research interests,we focused on the information propagation dynamics and synchronization phenomena over the complex networks.The works we do in these fields are following:
We have systematically investigated the dynamics of information propagation over scale-free networks.Because the sizes of modern communication networks are becoming bigger and bigger,even worse,the topology of the networks is everchanging,the traditional routing strategies,which based on the global topological information,suffer lack of storage and computational power.Considering this situation,we have proposed several routing strategies of sending data packets only based on local information.We can quantify the capacity of a network by the phase transition from free flow state to congestion state,and we have found the optimal parameter values,resulting in the highest efficiency of scale-free networks.Moreover,we found appropriately increasing information of network topology can greatly increase the capacity of the network,for example,next nearest-neighbor searching strategy.In the practical design of the routing strategy,we can trade off cost against capability of the system in order to find an optimal solution.Our results may be useful for designing next generation routing protocol.
We have studied the collective synchronization behavior over scale-free networks and proposed a decoupling process to enhance the synchronizability of scale-free networks. With perturbation on the network structure,we investigated how th characteristic parameters,for example the average shortest path,the maximum betweenness and so on,affect the synchronizability of the networks.We find that the maximum betweenness have a linear-like relation with synchronizability of the network.The results indicate that the maximum betweenness is a best token of network synchronizability among similar network structure so far.
We also investigated geographical effect on small-world network synchronization. Many real world networks are embeded in some specific space,nodes have coordinets and links denote some real interactions.We have explored the effects of coupling strength, which coming from geographical restriction,on network synchronizability on one- and two- dimensional lattices.It is found that network synchronizability is a nontrivial function of distance and coupling strength.Our findings shed some light on the collective dynamics of real coupled systems.
We find information propagation on a complex network have some relations with synchronization on the network:Networks with high system capacity often show high network synchronizability.Actually,synchronization process is also a process of transmission of coupling information.The two seemingly irrelevant research subjects have the same underlying dynamical nature,reflecting different aspects of the properties of the system.
引文
[1] D.J. Watts and S. H. Strogaz.Collective dynamics of 'small-world' networks, Nature (London) 393, 440 (1998).
[2] A.-L. Barabasi, and R. Albert, Emergence of scaling in random networks, Science 286, 509 (1999).
[3] R. Albert and A.-L. Barabasi, Statistical mechanics of complex networks, Rev. Mod. Phys. 74, 47 (2002).
[4] M. E. J. Newman, The structure and function of complex networks, SIAM Review 45, 167-256 (2003).
[5] D. J. Watts, Networks, dynamics, and the small world phenomenon, Annu. Rev. Sociol. 30, 243 (2004).
[6] S. N. Dorogovtsev and J. F. F. Mendes,Evolution of networks, Adv. Phys. 51, 1079 (2002).
[7] S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, D.-U. Hwang, Complex networks: Structure and dynamics, Physics Reports 424, 175 (2006).
[8] E. Ravasz, A.-L. Barabasi, Hierarchical organization in complex networks , Phys. Rev. E 67, 026112 (2003).
[9] S. Shen2Orr, R. Milo, S. Mangan, U. Alon, Network motifs in the transcriptional regulation network of Escherichia coli, Nature Genet. 31, 64 (2002).
[10] R. Milo, S. Shen2Orr, S. Itzkovitz, N. Kashan, D. Chklovskii, U. Alon, Superfamilies of evolved and designed networks, Science 298, 824 (2002).
[11] S. Mangan, U. Alon, Structure and function of the feed-forward loop network motif, Proc. Natl. Acad. Sci. USA 100, 11980 (2003).
[12] R. Milo, S. Itzkovitz, N. Kashtan, R. Levitt, S. Shen2Orr, I. Ayzenshtat, M. Sheffer, U. Alon, Network Motifs : Simple building blocks of complex networks, Science 303, 1538 (2004).
[13] N. Kashtan, S. Itzkovitz, R. Milo, U. Alon, Eficient sampling algorithm for estimating subgraph concentrations and detecting network motifs, Bioinformatics 20, 1746 (2004).
[14] F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, D. Parisi, Defining and identifying communities in networks, Proc. Natl. Acad. Sci. U.S.A. 101, 2658 (2004).
[15] J. Moody, Race, school integration and friendship segregation in America, Am. J. Sociol. 107, 679 (2001).
[16] R. Guimera, M. SALES-PARDO, L. AMARAL, Classes of complex networks defined by role-to-role connectivity profiles, Nat. Phys. 3, 63 (2007).
[17] S. Yook, H. Jeong, A. -L. Barabasi , Modeling the Internet ' s large-scale topology, Proc. Natl. Acad. Sci. USA 99, 13382. (2002).
[18] C, Song, S. Havlin, H. Maksel , Self-similarity of complex networks, Nature 433, 392. (2005).
[19] M. Kuperman, G. Abramson, Small World Effect in an Epidemiological Model, Phys. Rev. Lett. 86, 2909. (2000).
[20] B. Tadic, Modeling Traffic of Information Packets on Graphs with Complex Topology, edited by P. Sloot et al., Lecture Notes in Computer Science (Springer, Berlin, 2003).
[21] G. Huygenii, Horoloquim oscilatoriumm (Parisiism, 1673).
[22] D. Bu et al., Topological structure analysis of the protein-protein interaction network in budding yeast, Nucleic Acids Research, 31, 2443 (2003).
[23] R.M. Anderson and R.M. May, Infectious Diseases in Humans (Oxford University Press, Oxford, 1992).
[24] S. Milgram, The small world problem, Psychol. Today 1, 60 (1967).
[25] P. Erdos,, and A. Rinyi, On random graphs, Publ. Math. (Debrecen) 6, 290 (1959).
[26] S. Maslov, and K. Sneppen, Specificity and stability in topology of protein networks, Science 296, 910 (2002).
[27] R. Pastor-Satorras, A. Vazquez,, and A. Vespignani, Dynamical and correlation properties of the Internet, Phys. Rev. Lett. 87, 258701 (2001).
[28] M. E. J. Newman, Assortative mixing in networks, Phys. Rev. Lett. 89, 208701 (2002).
[29]A.Barrat,M.Barthelemy,R.Pastor-Satorras,and A.Vespignani,Proc.Natl.Acad.Sci.U.S.A.101,3747(2004).
[30]S.H.Yook,H.Jeong,A.-L.Barabasi,and Y.Tu,Phys.Rev.Lett.86,5835(2001).
[31]A.Barrat,M.Barthelemy,and A.Vespignani,Phys.Rev.Lett.92,228701(2004).
[32]W.-X.Wang,B.-H.Wang,B.Hu,G.Yan,and Q.Ou,Phys.Key.Lett.94,188702(2005).
[33]S.A.Kauffman,J.Theor.Biol.22,437(1969a).
[34]S.A.Kanffman,Nature(London)224,177(1969).
[35]W.-X.Wang,B.Hu,T.Zhou,B.-H.Wang,and Y.-B.Xie,Phys.Rev.E 72,046140(2005).
[36]W.-X.Wang,B.Hu,B.-H.Wang,and G.Yan,Phys.Rev.E 73,016133(2006).
[37]Z.-X.Wu,X.-J.Xu and Y.-H.Wang,Phys.Rev.E 71,066124(2005).
[38]M.E.J.Newman and D.J.Watts,Phys.Rev.E 60,7332(1999).
[39]M.A.deMenezes,and A.-L.Barabasi,Phys.Rev.Lett.92,028701(2004).
[40]B.Tadie,S.Thurner,and G.J.Rodgers,Traffic on complex networks:Towards understanding global statistical properties from microscopic density fluctuations,Phys.Rev.E 69,036102(2004).
[41]B.Tadie and S.Thurner,Information super-diffusion on structured networks,Physica A 332,566(2004).
[42]A.Arenas,A.Diaz-Guilera,and R.Guimera,Communication in Networks with Hierarchical Branching,Phys.Rev.Lett.86,3196(2001).
[43]L.Zhao,Y.-C.Lai,K.Park,and N.Ye,Onset of traffic congestion in complex networks,Phys.Rev.E 71,026125(2005).
[44]W.-X.Wang,B.-H.Wang,C.-Y.Yin,Y.-B.Xie,and T.Zhou,Phys.Rev.E 73,026111(2006).
[45]G.Yan,T.Zhou,B.Hu,Z.-Q.Fu,B.-H.Wang,Phys.Rev.E,73,046108(2006).
[46]P.Echenique,Jesus G.-G,and Y.Moreno,Phys.Rev.E 70,056105(2004).
[47]W.-X.Wang,C.-Y.Yin,G.Yan and B.-H.Wang,Intergrating local static and dynamic information for routing traffic,Phys.Rev.E 74,016101(2006).
[48]M.-B.Hu,W.-X.Wang,R.Jiang,Q.-S.Wu,and Y.-H.Wu,Phys.Rev.E 75,036102(2007).
[49]Z.Neda,E.Ravasz,Y.Brechet,T.Vicsek,and A.-L.Barabasi,Nature 403,849(2000).
[50]F.S.Vannucchi,S.Boccaletti,Math.Biosci.Eng.1,49(2004).
[51]D.Hansel and H.Sompolinsky,Phys.Rev.Lett.68,718(1992).
[52]H.G.Winful,L.Rahman,Phys.Rev.Lett.65,1575(1990).
[53]K.Otsuka,R.Kawal,S.Hwong,J.Ko,and J.Chern,Phys.Rev.Lett.84,3049(2000).
[54]X.F.Wang,Int.J.Bifurcation Chaos Appl.Sci.Eng.12,885(2002);
[55]L.M.Pecora and T.L.Carroll,Phys.Rev.Lett.80,2109(1998).
[56]X.Guardiola,A.Diaz-Guilera,M.Llas,and C.J.Perez,Phys.Rev.E 62,5565(2000).
[57]T.Nishikawa,A.E.Motter,Y.-C.Lai,and F.C.Hoppensteadt,Phys.Rev.Lett.91,014101(2003).
[58]H.Hong,B.J.Kim,M.Y.Choi,and H.Park,Factors that predict better synchronizability on complex networks,Phys.Rev.E 69,067105(2004).
[59]A.E.Motter,C.Zhou and J.Kurths,Phys.Rev.E 71,016116(2005).
[60]M.Chavez,D.-U.Hwang,A.Amann,H.G.E.Hentschel,and S.Boccaletti,Synchronization is Enhanced in Weighted Complex Networks,Phys.Rev.Lett.94,218701(2005);
[61]C.Zhou,A.E.Motter,and J.Kurths,Universality in the Synchronization of Weighted Random Networks,Phys.Rev.Lett.96,034101(2006).
[62]J.Gomez-Gardenes,Y.Moreno,A.Arenas,Paths to Synchronization on Complex Networks,Phys.Rev.Lett.98,034101(2007).
[63]Y.Kuramoto,in Proceedings of the International Symposium on Mathematical Problems in Theoretical Physics,edited by H.Araki New York:Springer-Verlag,1975.
[64]M.Zhao,T.Zhou,B.-H.Wang,and W.-X.Wang,Phys.Rev.E 72,057102(2005).
[65]C.-Y.Yin,W.-X.Wang,G.Chen,and B.-H.Wang,Phys.Rev.E 74,047102(2006).
[66]J.H.Jones,M.S.Handcock,Nature 423,605(2003).
[67]B.Grenfell and O.Bj(?)rnstad,Nature 433,366(2005).
[68]R.Pastor-Satorras,and A.Vespignani,Epidemic spreading in scale-free networks,Phys.Rev.Lett.86,3200(2001).
[69]V.M.Eguiluz and K.Klemm,Phys.Rev.Lett.89,108701(2002).
[70]M.Barthelemy,A.Barrat,R.Pastor-Satorras,and A.Vespignani,Phys.Rev.Lett.92,178701(2004).
[71]M.E.J.Newman,Phys.Rev.Lett.95,108701(2005).
[72]R.Silva,A.Plastino,J.Lima,Phys.Lett.A 249,401(1998).
[73]J.von Neumann and O.Morgenstern,Theory of Games and Economic Behaviour (Princeton University Press,Princeton,1944).
[74]A.M.Colman,Game Theory and its Applications in the Social and Biological Sciences (Butterworth-Heinemann,Oxford,1995).
[75]R.Sugden,The Economics of Rights,Co-operation and Weffare(Blackwell,Oxford,U.K.,1986).
[76]Genetic and Cultural Evolution of Cooperation,edited by Peter Hammerstein(MIT,Cambridge,MA,2003).
[77]K.Sigmund,Games of Life(Oxford University Press,Oxford,1993).
[78]R.Axelrod,The Evolution of Cooperation(Basic books,New York,1984).
[79]J.Maynard Smith,Evolution and the Theory of Games(Cambridge University Press,Cambridge,England,1982).
[80]J.Hofbauer and K.Sigmund,Evolutionary Games and Population Dynamics(Cambridge University Press,Cambridge,U.K.,1998).
[81]D.J.Watts,Small Worlds:The Dynamics of Networks Between Order and Randomness (Princeton,New Jersey,1999).
[82]H.Gintis,Game Theory Evolving(Princeton University,Princeton,N J,2000).
[83]M.Nowak and K.Sigmund,Nature(London)355,250(1992).
[84]M.Nowak,and K.Sigmund,Nature(London)364,56(1993).
[85]M.Nowak and R.M.May,Evolutionary games and spatial chaos,Nature(London)359,826(1992);Int.J.Bifurcation Chaos Appl.Sci.Eng.3,35(1993).
[86]C.Hauert and M.Doebeli,Spatial structure often inhibits the evolution of cooperation in the snowdrift game,Nature 428,643(2004).
[87]G.Szabo and C.Toke,Phys.Rev.E 58,69(1998).
[88]G.Szabo and C.Hauert,Phys.R.ev.Lett.89,118101(2002).
[89]G.Abramson and M.Kuperman,Social games in a social network,Phys.Rev.E 63,030901(R)(2001).
[90]B.J.Kim,A.Trusina,P.Holme,P.Minnhagen,J.S.Chung,M.Y.Choi,Dynamic instabilities induced by asymmetric influence:Prisoners' dilemma game on small-world networks,Phys.Rev.E 66,021907(2002).
[91]G.Szabo and C.Hauert,Evolutionary prisoner's dilemma games with voluntary participation,Phys.Rev.E 66,062903(2002).
[92]G.Szabo and J.Vukov,Cooperation for volunteering and partially random partnerships,Phys.Rev.E 69,036107(2004).
[93]J.Vukov and G.Szab6,Evolutionary prisoner's dilemma game on hierarchical lattices,Phys.Rev.E 71,036133(2005).
[94]C.Hauert and G.Szabo,Game theory and physics,Am.J.Phys.73,405(2005).
[95]Z.-X.Wu,X.-J.Xu,Y.Chen,and Y.-H.Wang,Spatial prisoner's dilemma game with volunteering in Newman-Watts small-world networks,Phys.Rev.E 71,037103(2005).
[96]F.C.Santos and J.M.Pacheco,Scale-free networks provide a unifying framework for the emergence of cooperation,Phys.Rev.Lett.95,098104(2005).
[97]J.Gomez-Gardenes,M.Campillo,L.M.Floria,and Y.Moreno,Phys.Rev.Lett.98,108103(2007)
[98]W.-X.Wang,J.Ren,G.Chen,and B.-H.Wang,Phys.Rev.E 74,056113(2006).
[99]C.-L.Tang,W.-X.Wang,X.Wu,and B.-H.Wang,Eur.Phys.J.B 53,411(2006).
[100]J.Ren,W.-X.Wang,and F.Qi,Phys.Rev.E 75,045101(R)(2007).
[101]S.A.Kauffman,Metabolic Stability and Epigenesis in Randomly Constructed Nets,Journal of Theoretical Biology 22,437(1969).
[102]S.A.Kanffman,The Origins of Order:Self-organization and Selection in Evolution,Oxford University Press,Oxford,1993.
[103]A.E.Motter,Cascade Control and Defense in Complex Networks,Phys.Rev.Lett.93,098701(2004).
[104]R.Pastor-Satorras and A.Vespignani,Evolution and Structure of the Internet:A Statistical Physics Approach(Cambridge University Press,Cambridge,England,2004).
[105]R.Albert,H.Jeong,and A.-L.Barabasi,Nature 401,130(1999).
[106]M.E.J.Newman,Phys.Rev.E 64,016132(2001).
[107]E.Ravasz and A.-L Barabasi,Phys.Rev.E 67,026112(2003).
[108]M.E.J.Newman,Phys.Rev.E 67,026126(2003).
[109]G.Mukherjee,and S.S.Manna,Phys.Rev.E 71,066108(2005).
[110]D.J.Ashton,T.C.Jarrett,and N.F.Johnson,Phys.Rev.Lett.94,058701(2005).
[111]R.Guimera,A.Diaz-Guilera,F.Vega-Redondo,A.Cabrales,and A.Arenas,Phys.Rev.Lett.89,248701(2002).
[112]R.Guimera,A.Arenas,A.Diaz-Guilera,and F.Giralt,Phys.Rev.E 66,026704(2002).
[113]M.S.Taqqu,W.Willinger,and R.Sherman,Comput.commun.Rev.27,5(1997).
[114]Petter Holme,and Beom Jun Kim,Phys.Rev.E 65,066109(2002).
[115]V.Cholvi,V.Laderas,L.Lopez,and A.Fernandez,Phys.Rev.E 71,035103(R)(2005).
[116]B.K.Singh,and N.Gupte,Congestion and decongestion in a communication network,Phys.Rev.E 71,055103(R)(2005).
[117]M.A.deMenezes,and A.-L.Barabasi,Phys.Rev.Lett.93,068701(2004).
[118]K.-I.Goh,D.S.Lee,B.Kahng,and D.Kim,Phys.Rev.Lett.91,148701(2003).
[119]L.Zhao,K.Park,and Y.C.Lal,Phys.Rev.E 70,035101(R)(2004).
[120]E.J.Lee,K.-I.Goh,B.Kahng,and D.Kim,Phys.Rev.Lett.71,056108(2005).
[121]B.J.Kim,C.N.Yoon,S.K.Han,and H.Jeong,Phys.Rev.E 65,027103(2002).
[122]See,for example,O.Allen,Probability,Statistics and Queueing Theory with Computer Science Application,2nd ed.(Academic,New York,1990).
[123]The detailed defination can be seen in Ref.
[124]M.Barahona,and L.M.Pecora,Synchronization in Small-World Systems,Phys.Rev.Lett.89,054101(2002)
[125]L.M.Pecora and M.Barahona,Chaos and Complexity letters,1(1),61(2005).
[126]P.L.Krapivsky,S.Redner and F.Leyvraz,Phys.Rev.Lett.85,4629(2000).
[127]M.E.J.Newman and M.Girvan,Phys.Rev.E 69,026113(2004).
[128]A.F.Rozenfeld,R.Cohen,D.ben-Avraham,and S.Havlin,Phys.Rev.Lett.89,218701(2002).
[129]L.Huang,L.Yang,and K.Yang,Phys.Rev.E 73,036102(2006);
[130]X.-J.Xu,W.-X.Wang,T.Zhou,and G.Chen,Int.J.Mod.Phys.C 17,1815 2006;
[131]X.-J.Xu,Z.-X.Wu,and G.Chen,Physica A 377,125(2007).
[132]Y.Hayashi,IPSJ Digital Courier 2,155(2006).
[133]B.K.Singh and N.Gupte,Phys.Rev.E 71,055103(R)(2005).
[134]D.-U.Hwang,M.Chavez,A.Amann,and S.Boccaletti,Synchronization in Complex Networks with Age Ordering,Phys.Rev.Lett.94,138701(2005).
[135]M.E.J.Newman,Scientific collaboration networks.Ⅰ.Network construction and fundamental results,Phys.Rev.E 64,016131(2000);Scientific collaboration networks.Ⅱ.Network construction and fundamental results,Phys.Rev.E 64,016132(2000).
[2] A.-L. Barabasi, and R. Albert, Emergence of scaling in random networks, Science 286, 509 (1999).
[3] R. Albert and A.-L. Barabasi, Statistical mechanics of complex networks, Rev. Mod. Phys. 74, 47 (2002).
[4] M. E. J. Newman, The structure and function of complex networks, SIAM Review 45, 167-256 (2003).
[5] D. J. Watts, Networks, dynamics, and the small world phenomenon, Annu. Rev. Sociol. 30, 243 (2004).
[6] S. N. Dorogovtsev and J. F. F. Mendes,Evolution of networks, Adv. Phys. 51, 1079 (2002).
[7] S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, D.-U. Hwang, Complex networks: Structure and dynamics, Physics Reports 424, 175 (2006).
[8] E. Ravasz, A.-L. Barabasi, Hierarchical organization in complex networks , Phys. Rev. E 67, 026112 (2003).
[9] S. Shen2Orr, R. Milo, S. Mangan, U. Alon, Network motifs in the transcriptional regulation network of Escherichia coli, Nature Genet. 31, 64 (2002).
[10] R. Milo, S. Shen2Orr, S. Itzkovitz, N. Kashan, D. Chklovskii, U. Alon, Superfamilies of evolved and designed networks, Science 298, 824 (2002).
[11] S. Mangan, U. Alon, Structure and function of the feed-forward loop network motif, Proc. Natl. Acad. Sci. USA 100, 11980 (2003).
[12] R. Milo, S. Itzkovitz, N. Kashtan, R. Levitt, S. Shen2Orr, I. Ayzenshtat, M. Sheffer, U. Alon, Network Motifs : Simple building blocks of complex networks, Science 303, 1538 (2004).
[13] N. Kashtan, S. Itzkovitz, R. Milo, U. Alon, Eficient sampling algorithm for estimating subgraph concentrations and detecting network motifs, Bioinformatics 20, 1746 (2004).
[14] F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, D. Parisi, Defining and identifying communities in networks, Proc. Natl. Acad. Sci. U.S.A. 101, 2658 (2004).
[15] J. Moody, Race, school integration and friendship segregation in America, Am. J. Sociol. 107, 679 (2001).
[16] R. Guimera, M. SALES-PARDO, L. AMARAL, Classes of complex networks defined by role-to-role connectivity profiles, Nat. Phys. 3, 63 (2007).
[17] S. Yook, H. Jeong, A. -L. Barabasi , Modeling the Internet ' s large-scale topology, Proc. Natl. Acad. Sci. USA 99, 13382. (2002).
[18] C, Song, S. Havlin, H. Maksel , Self-similarity of complex networks, Nature 433, 392. (2005).
[19] M. Kuperman, G. Abramson, Small World Effect in an Epidemiological Model, Phys. Rev. Lett. 86, 2909. (2000).
[20] B. Tadic, Modeling Traffic of Information Packets on Graphs with Complex Topology, edited by P. Sloot et al., Lecture Notes in Computer Science (Springer, Berlin, 2003).
[21] G. Huygenii, Horoloquim oscilatoriumm (Parisiism, 1673).
[22] D. Bu et al., Topological structure analysis of the protein-protein interaction network in budding yeast, Nucleic Acids Research, 31, 2443 (2003).
[23] R.M. Anderson and R.M. May, Infectious Diseases in Humans (Oxford University Press, Oxford, 1992).
[24] S. Milgram, The small world problem, Psychol. Today 1, 60 (1967).
[25] P. Erdos,, and A. Rinyi, On random graphs, Publ. Math. (Debrecen) 6, 290 (1959).
[26] S. Maslov, and K. Sneppen, Specificity and stability in topology of protein networks, Science 296, 910 (2002).
[27] R. Pastor-Satorras, A. Vazquez,, and A. Vespignani, Dynamical and correlation properties of the Internet, Phys. Rev. Lett. 87, 258701 (2001).
[28] M. E. J. Newman, Assortative mixing in networks, Phys. Rev. Lett. 89, 208701 (2002).
[29]A.Barrat,M.Barthelemy,R.Pastor-Satorras,and A.Vespignani,Proc.Natl.Acad.Sci.U.S.A.101,3747(2004).
[30]S.H.Yook,H.Jeong,A.-L.Barabasi,and Y.Tu,Phys.Rev.Lett.86,5835(2001).
[31]A.Barrat,M.Barthelemy,and A.Vespignani,Phys.Rev.Lett.92,228701(2004).
[32]W.-X.Wang,B.-H.Wang,B.Hu,G.Yan,and Q.Ou,Phys.Key.Lett.94,188702(2005).
[33]S.A.Kauffman,J.Theor.Biol.22,437(1969a).
[34]S.A.Kanffman,Nature(London)224,177(1969).
[35]W.-X.Wang,B.Hu,T.Zhou,B.-H.Wang,and Y.-B.Xie,Phys.Rev.E 72,046140(2005).
[36]W.-X.Wang,B.Hu,B.-H.Wang,and G.Yan,Phys.Rev.E 73,016133(2006).
[37]Z.-X.Wu,X.-J.Xu and Y.-H.Wang,Phys.Rev.E 71,066124(2005).
[38]M.E.J.Newman and D.J.Watts,Phys.Rev.E 60,7332(1999).
[39]M.A.deMenezes,and A.-L.Barabasi,Phys.Rev.Lett.92,028701(2004).
[40]B.Tadie,S.Thurner,and G.J.Rodgers,Traffic on complex networks:Towards understanding global statistical properties from microscopic density fluctuations,Phys.Rev.E 69,036102(2004).
[41]B.Tadie and S.Thurner,Information super-diffusion on structured networks,Physica A 332,566(2004).
[42]A.Arenas,A.Diaz-Guilera,and R.Guimera,Communication in Networks with Hierarchical Branching,Phys.Rev.Lett.86,3196(2001).
[43]L.Zhao,Y.-C.Lai,K.Park,and N.Ye,Onset of traffic congestion in complex networks,Phys.Rev.E 71,026125(2005).
[44]W.-X.Wang,B.-H.Wang,C.-Y.Yin,Y.-B.Xie,and T.Zhou,Phys.Rev.E 73,026111(2006).
[45]G.Yan,T.Zhou,B.Hu,Z.-Q.Fu,B.-H.Wang,Phys.Rev.E,73,046108(2006).
[46]P.Echenique,Jesus G.-G,and Y.Moreno,Phys.Rev.E 70,056105(2004).
[47]W.-X.Wang,C.-Y.Yin,G.Yan and B.-H.Wang,Intergrating local static and dynamic information for routing traffic,Phys.Rev.E 74,016101(2006).
[48]M.-B.Hu,W.-X.Wang,R.Jiang,Q.-S.Wu,and Y.-H.Wu,Phys.Rev.E 75,036102(2007).
[49]Z.Neda,E.Ravasz,Y.Brechet,T.Vicsek,and A.-L.Barabasi,Nature 403,849(2000).
[50]F.S.Vannucchi,S.Boccaletti,Math.Biosci.Eng.1,49(2004).
[51]D.Hansel and H.Sompolinsky,Phys.Rev.Lett.68,718(1992).
[52]H.G.Winful,L.Rahman,Phys.Rev.Lett.65,1575(1990).
[53]K.Otsuka,R.Kawal,S.Hwong,J.Ko,and J.Chern,Phys.Rev.Lett.84,3049(2000).
[54]X.F.Wang,Int.J.Bifurcation Chaos Appl.Sci.Eng.12,885(2002);
[55]L.M.Pecora and T.L.Carroll,Phys.Rev.Lett.80,2109(1998).
[56]X.Guardiola,A.Diaz-Guilera,M.Llas,and C.J.Perez,Phys.Rev.E 62,5565(2000).
[57]T.Nishikawa,A.E.Motter,Y.-C.Lai,and F.C.Hoppensteadt,Phys.Rev.Lett.91,014101(2003).
[58]H.Hong,B.J.Kim,M.Y.Choi,and H.Park,Factors that predict better synchronizability on complex networks,Phys.Rev.E 69,067105(2004).
[59]A.E.Motter,C.Zhou and J.Kurths,Phys.Rev.E 71,016116(2005).
[60]M.Chavez,D.-U.Hwang,A.Amann,H.G.E.Hentschel,and S.Boccaletti,Synchronization is Enhanced in Weighted Complex Networks,Phys.Rev.Lett.94,218701(2005);
[61]C.Zhou,A.E.Motter,and J.Kurths,Universality in the Synchronization of Weighted Random Networks,Phys.Rev.Lett.96,034101(2006).
[62]J.Gomez-Gardenes,Y.Moreno,A.Arenas,Paths to Synchronization on Complex Networks,Phys.Rev.Lett.98,034101(2007).
[63]Y.Kuramoto,in Proceedings of the International Symposium on Mathematical Problems in Theoretical Physics,edited by H.Araki New York:Springer-Verlag,1975.
[64]M.Zhao,T.Zhou,B.-H.Wang,and W.-X.Wang,Phys.Rev.E 72,057102(2005).
[65]C.-Y.Yin,W.-X.Wang,G.Chen,and B.-H.Wang,Phys.Rev.E 74,047102(2006).
[66]J.H.Jones,M.S.Handcock,Nature 423,605(2003).
[67]B.Grenfell and O.Bj(?)rnstad,Nature 433,366(2005).
[68]R.Pastor-Satorras,and A.Vespignani,Epidemic spreading in scale-free networks,Phys.Rev.Lett.86,3200(2001).
[69]V.M.Eguiluz and K.Klemm,Phys.Rev.Lett.89,108701(2002).
[70]M.Barthelemy,A.Barrat,R.Pastor-Satorras,and A.Vespignani,Phys.Rev.Lett.92,178701(2004).
[71]M.E.J.Newman,Phys.Rev.Lett.95,108701(2005).
[72]R.Silva,A.Plastino,J.Lima,Phys.Lett.A 249,401(1998).
[73]J.von Neumann and O.Morgenstern,Theory of Games and Economic Behaviour (Princeton University Press,Princeton,1944).
[74]A.M.Colman,Game Theory and its Applications in the Social and Biological Sciences (Butterworth-Heinemann,Oxford,1995).
[75]R.Sugden,The Economics of Rights,Co-operation and Weffare(Blackwell,Oxford,U.K.,1986).
[76]Genetic and Cultural Evolution of Cooperation,edited by Peter Hammerstein(MIT,Cambridge,MA,2003).
[77]K.Sigmund,Games of Life(Oxford University Press,Oxford,1993).
[78]R.Axelrod,The Evolution of Cooperation(Basic books,New York,1984).
[79]J.Maynard Smith,Evolution and the Theory of Games(Cambridge University Press,Cambridge,England,1982).
[80]J.Hofbauer and K.Sigmund,Evolutionary Games and Population Dynamics(Cambridge University Press,Cambridge,U.K.,1998).
[81]D.J.Watts,Small Worlds:The Dynamics of Networks Between Order and Randomness (Princeton,New Jersey,1999).
[82]H.Gintis,Game Theory Evolving(Princeton University,Princeton,N J,2000).
[83]M.Nowak and K.Sigmund,Nature(London)355,250(1992).
[84]M.Nowak,and K.Sigmund,Nature(London)364,56(1993).
[85]M.Nowak and R.M.May,Evolutionary games and spatial chaos,Nature(London)359,826(1992);Int.J.Bifurcation Chaos Appl.Sci.Eng.3,35(1993).
[86]C.Hauert and M.Doebeli,Spatial structure often inhibits the evolution of cooperation in the snowdrift game,Nature 428,643(2004).
[87]G.Szabo and C.Toke,Phys.Rev.E 58,69(1998).
[88]G.Szabo and C.Hauert,Phys.R.ev.Lett.89,118101(2002).
[89]G.Abramson and M.Kuperman,Social games in a social network,Phys.Rev.E 63,030901(R)(2001).
[90]B.J.Kim,A.Trusina,P.Holme,P.Minnhagen,J.S.Chung,M.Y.Choi,Dynamic instabilities induced by asymmetric influence:Prisoners' dilemma game on small-world networks,Phys.Rev.E 66,021907(2002).
[91]G.Szabo and C.Hauert,Evolutionary prisoner's dilemma games with voluntary participation,Phys.Rev.E 66,062903(2002).
[92]G.Szabo and J.Vukov,Cooperation for volunteering and partially random partnerships,Phys.Rev.E 69,036107(2004).
[93]J.Vukov and G.Szab6,Evolutionary prisoner's dilemma game on hierarchical lattices,Phys.Rev.E 71,036133(2005).
[94]C.Hauert and G.Szabo,Game theory and physics,Am.J.Phys.73,405(2005).
[95]Z.-X.Wu,X.-J.Xu,Y.Chen,and Y.-H.Wang,Spatial prisoner's dilemma game with volunteering in Newman-Watts small-world networks,Phys.Rev.E 71,037103(2005).
[96]F.C.Santos and J.M.Pacheco,Scale-free networks provide a unifying framework for the emergence of cooperation,Phys.Rev.Lett.95,098104(2005).
[97]J.Gomez-Gardenes,M.Campillo,L.M.Floria,and Y.Moreno,Phys.Rev.Lett.98,108103(2007)
[98]W.-X.Wang,J.Ren,G.Chen,and B.-H.Wang,Phys.Rev.E 74,056113(2006).
[99]C.-L.Tang,W.-X.Wang,X.Wu,and B.-H.Wang,Eur.Phys.J.B 53,411(2006).
[100]J.Ren,W.-X.Wang,and F.Qi,Phys.Rev.E 75,045101(R)(2007).
[101]S.A.Kauffman,Metabolic Stability and Epigenesis in Randomly Constructed Nets,Journal of Theoretical Biology 22,437(1969).
[102]S.A.Kanffman,The Origins of Order:Self-organization and Selection in Evolution,Oxford University Press,Oxford,1993.
[103]A.E.Motter,Cascade Control and Defense in Complex Networks,Phys.Rev.Lett.93,098701(2004).
[104]R.Pastor-Satorras and A.Vespignani,Evolution and Structure of the Internet:A Statistical Physics Approach(Cambridge University Press,Cambridge,England,2004).
[105]R.Albert,H.Jeong,and A.-L.Barabasi,Nature 401,130(1999).
[106]M.E.J.Newman,Phys.Rev.E 64,016132(2001).
[107]E.Ravasz and A.-L Barabasi,Phys.Rev.E 67,026112(2003).
[108]M.E.J.Newman,Phys.Rev.E 67,026126(2003).
[109]G.Mukherjee,and S.S.Manna,Phys.Rev.E 71,066108(2005).
[110]D.J.Ashton,T.C.Jarrett,and N.F.Johnson,Phys.Rev.Lett.94,058701(2005).
[111]R.Guimera,A.Diaz-Guilera,F.Vega-Redondo,A.Cabrales,and A.Arenas,Phys.Rev.Lett.89,248701(2002).
[112]R.Guimera,A.Arenas,A.Diaz-Guilera,and F.Giralt,Phys.Rev.E 66,026704(2002).
[113]M.S.Taqqu,W.Willinger,and R.Sherman,Comput.commun.Rev.27,5(1997).
[114]Petter Holme,and Beom Jun Kim,Phys.Rev.E 65,066109(2002).
[115]V.Cholvi,V.Laderas,L.Lopez,and A.Fernandez,Phys.Rev.E 71,035103(R)(2005).
[116]B.K.Singh,and N.Gupte,Congestion and decongestion in a communication network,Phys.Rev.E 71,055103(R)(2005).
[117]M.A.deMenezes,and A.-L.Barabasi,Phys.Rev.Lett.93,068701(2004).
[118]K.-I.Goh,D.S.Lee,B.Kahng,and D.Kim,Phys.Rev.Lett.91,148701(2003).
[119]L.Zhao,K.Park,and Y.C.Lal,Phys.Rev.E 70,035101(R)(2004).
[120]E.J.Lee,K.-I.Goh,B.Kahng,and D.Kim,Phys.Rev.Lett.71,056108(2005).
[121]B.J.Kim,C.N.Yoon,S.K.Han,and H.Jeong,Phys.Rev.E 65,027103(2002).
[122]See,for example,O.Allen,Probability,Statistics and Queueing Theory with Computer Science Application,2nd ed.(Academic,New York,1990).
[123]The detailed defination can be seen in Ref.
[124]M.Barahona,and L.M.Pecora,Synchronization in Small-World Systems,Phys.Rev.Lett.89,054101(2002)
[125]L.M.Pecora and M.Barahona,Chaos and Complexity letters,1(1),61(2005).
[126]P.L.Krapivsky,S.Redner and F.Leyvraz,Phys.Rev.Lett.85,4629(2000).
[127]M.E.J.Newman and M.Girvan,Phys.Rev.E 69,026113(2004).
[128]A.F.Rozenfeld,R.Cohen,D.ben-Avraham,and S.Havlin,Phys.Rev.Lett.89,218701(2002).
[129]L.Huang,L.Yang,and K.Yang,Phys.Rev.E 73,036102(2006);
[130]X.-J.Xu,W.-X.Wang,T.Zhou,and G.Chen,Int.J.Mod.Phys.C 17,1815 2006;
[131]X.-J.Xu,Z.-X.Wu,and G.Chen,Physica A 377,125(2007).
[132]Y.Hayashi,IPSJ Digital Courier 2,155(2006).
[133]B.K.Singh and N.Gupte,Phys.Rev.E 71,055103(R)(2005).
[134]D.-U.Hwang,M.Chavez,A.Amann,and S.Boccaletti,Synchronization in Complex Networks with Age Ordering,Phys.Rev.Lett.94,138701(2005).
[135]M.E.J.Newman,Scientific collaboration networks.Ⅰ.Network construction and fundamental results,Phys.Rev.E 64,016131(2000);Scientific collaboration networks.Ⅱ.Network construction and fundamental results,Phys.Rev.E 64,016132(2000).