Random Graph Modeling

Abstract

Random graph (RG) models play a central role in complex networks analysis. They help us to understand, control, and predict phenomena occurring, for instance, in social networks, biological networks, the Internet, and so on. Despite a large number of RG models presented in the literature, there are few concepts underlying them. Instead of trying to classify a wide variety of very dispersed models, we capture and describe concepts they exploit considering preferential attachment, copying principle, hyperbolic geometry, recursively defined structure, edge switching, Monte Carlo sampling, and so on. We analyze RG models, extract their basic principles, and build a taxonomy of concepts they are based on. We also discuss how these concepts are combined in RG models and how they work in typical applications like benchmarks, null models, and data anonymization.