A Mathematical Analysis of the R-MAT Random Graph Generator
The R-MAT graph generator introduced by Chakrabarti et al (Int Conf Data Mining, 2004) offers a simple, fast method for generating very large directed graphs. These properties have made it a popular choice as a method of generating graphs for objects of study in a variety of disciplines, from social network analysis to high performance computing. We analyze the graphs generated by R-MAT and model the generator in terms of occupancy problems to prove results about the degree distributions of these graphs. We prove that the limiting degree distributions can be expressed as a mixture of normal distributions with means and variances that can be easily calculated from the R-MAT parameters. Additionally, this article offers an efficient computational technique for computing the exact degree distribution and concise expressions for a number of properties of R-MAT graphs. (C) 2011 Wiley Periodicals, Inc.* NETWORKS, Vol. 58(3), 159-170 2011
random graph occupancy problem scale-free graph r-mat generator