Some more mathematical treatments of random networks with non-Poisson degree distributions (including power-law distributions) can be found in: •• Aiello, W., Chung, F., and Lu, L. A random graph model for massive graphs. In

Computing (Association for Computing Machinery, New York, 2000), pp. 171-180. •• Molloy, M., and Reed, B. A critical point for random graphs with a given degree sequence.

Random Structures and Algorithms,

6, 161-179 (1995). •• Molloy, M., and Reed, B. The size of the giant component of a random graph with a given degree sequence.

Combinatorics, Probability, and Computing,

7, 295-305 (1998). •• Newman, M. E. J., Strogatz, S. H., and Watts, D. J. Random graphs with arbitrary degree distributions and their applications.

E,

64, 026118 (2001). (2) الأثرياء يزدادون ثراء

The paper by László Barabási and Réka Albert that introduced the idea of scale-free networks, and proposed a preferential attachment model of network growth to account for them, is: ⋆⋆ Barabási, A., and Albert, R. Emergence of scaling in random networks.

Science,

ناپیژندل شوی مخ