Random Networks

Complex networks describe a variety of systems found in nature and society. Traditionally these systems have been modelled as random graphs, a relatively primitive and brutal approach. These traditional models do not produce topological and structural properties featured in real network examples. In recent years many new models have been developed, to correctly describe the scale – free structure of real networks. In this papers the real world networks (WWW, Internet, ecological, cellular, etc.) are presented along with various theoretical models, that explain the emergence of the most important structural properties as average path length, clustering coefficient and power – tail degree distributions. In the end of the paper the basics of network evolution process is explained.

[1]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[2]  Eli Upfal,et al.  Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[3]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[4]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[5]  S. N. Dorogovtsev,et al.  Evolution of random networks , 2001 .

[6]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[7]  S. Redner,et al.  Organization of growing random networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[9]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.