Large Network Model of Complex Systems

Article Preview

Abstract:

We proposed a random network model to describe complex systems. The model is solved exactly by mean-field method and differential equation. We demonstrated the triangle distribution firstly to calculate the clustering coefficient. When the size of the network tends to infinity, the model has high clustering coefficient.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1036-1039

Citation:

Online since:

June 2010

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R. Albert and A.L. Barabasi, Statistical mechanics of complex networks. Rev. Mod. Phys., 74: 4797, (2002).

Google Scholar

[2] S.N. Dorogovtsev and J.F.F. Mendes, Evolution of networks. Adv. Phys. 51, 1079-1187, (2002).

Google Scholar

[3] M.E.J. Newman, The structure and function of complex networks. SIAM Review 45, 167256, (2003).

Google Scholar

[4] P. Erdos, A. Renyi, On random graphs. Publications Mathematicae, 6, 290-297, (1959).

Google Scholar

[5] A.L. Barabasi and R. Albert, Emergence of scaling in random networks. Science286, 50952, (1999).

Google Scholar

[6] E. Ravasz, A.L. Barabasi, Hierarchical Organization in Complex Networks. Physical Review E67, 026112, (2003).

Google Scholar

[7] Sara Nadiv Soffer and Alexei Vazquez, Clustering coefficient without degree correlations biases, Physical Review E71, 057101, (2005).

Google Scholar

[8] R. Albert, H. Jeong, and A. -L. Barabasi, Diameter of the World Wide Web. Nature 401: 130131, (1999).

Google Scholar