Random complex networks. Issue 3 (18th July 2014)

• Record Type: Journal Article
• Authors: Small, Michael; Hou, Lvlin; Zhang, Linjun
• Is Part Of: National science review. Volume 1:Issue 3(2014:Sep.)
• Page Start: 357
• Page End: 367
• Publication Date: 2014-07-18
• Subjects: complex networks -- scale-free networks -- random graph -- Markov chain Monte Carlo -- power-law -- network robustness; Science -- Periodicals; 505
• DOI: 10.1093/nsr/nwu021
• Languages: English
• ISSNs: 2095-5138

Abstract

Abstract: Exactly what is meant by a 'complex' network is not clear; however, what is clear is that it is something other than a random graph. Complex networks arise in a wide range of real social, technological and physical systems. In all cases, the most basic categorization of these graphs is their node degree distribution. Particular groups of complex networks may exhibit additional interesting features, including the so-called small-world effect or being scale-free. There are many algorithms with which one may generate networks with particular degree distributions (perhaps the most famous of which is preferential attachment). In this paper, we address what it means to randomly choose a network from the class of networks with a particular degree distribution, and in doing so we show that the networks one gets from the preferential attachment process are actually highly pathological. Certain properties (including robustness and fragility) which have been attributed to the (scale-free) degree distribution are actually more intimately related to the preferential attachment growth mechanism. We focus here on scale-free networks with power-law degree sequences—but our methods and results are perfectly generic.