Barabasi-Albert network

Nakao and Mikhailov [316] performed numerical simulations of an activator-inhibitor model, namely the Mimura-Murray model, on a large array, namely a Barabasi-Albert scale-free network with 1000 nodes and mean degree of 20 ... 

Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., and Barabasi, A. L. (2000). The large-scale organization ofmetabolic networks. Nature 407, 651-654. 

A-L Barabasi and Albert Reka, Emergence of Scaling in Random Networks, Science 286 (1999) P509-512. 

Barabasi, A-L., Albert Reka, and Jeong Hawoong, Mean-Field Theory for Scale-Free Random Networks, Physics A, 272, (1999) 173-187. 

Barabasi A-L, Albert R. Emergence of scaling in random networks. Science 1999 286 509-512. 

Jeong H, Tombor B, Albert R, Oltvai ZN, Barabasi A-L. The large-scale organization of metabolic networks. Nature 2000 407 651-654. 

R. Albert, H. Jeong, A.L. Barabasi, Error and attack tolerance of complex networks, Nature 2000, 406, 378-382. 

Scale-Free Networks The vertex degree distributions of scale-free networks differ from those of large random networks and many small worid networks, which are Poisson distributed (vide supra). By contrast, scale-free networks described by Barabasi and Albert [182] are nonhomogeneously distributed and follow power laws, such that the probability that a random vertex has degree k is inversely related to a power of vertex degree, i.e.,... 

Albert R, Barabasi A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74 47-97... 

---