A random graph model for massive graphs

We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize and log-log growth rate. These parameters capture some universal characteristics of massive graphs. Furthermore, from these parameters, various properties of the graph can be derived. For example, for certain ranges of the parameters, we will compute the expected distribution of the sizes of the connected components which almost surely occur with high probability. We will illustrate the consistency of our model with the behavior of some massive graphs derived from data in telecommunications. We will also discuss the threshold function, the giant component, and the evolution of random graphs in this model.

• Type: Conference
• Year: 2000
• Where: STOC
• Authors: William Aiello, Fan R. K. Chung, Linyuan Lu
• Keywords: Algorithms, Massive Graphs, Random Graphs, Sparse Random Graphs, STOC 2000