Whole Sampling Generation of Scale-Free Graphs

This paper presents the development of a new class of algorithms that accurately implement the preferential attachment mechanism of the Barabási–Albert (BA) model to generate scale-free graphs. Contrary to existing approximate preferential attachment schemes, our methods are exact in terms of the proportionality of the vertex selection probabilities to their degree and run in linear time with respect to the order of the generated graph. Our algorithms are based on a principle of random sampling which is called whole sampling and is a new perspective for the study of preferential attachment. We show that they obey the definition of the original BA model that generates scale-free graphs and discuss their higher-order properties. Finally, we extend our analytical presentation with computer experiments that focus on the degree distribution and several measures surrounding the local clustering coefficient.

[1]  Stefan Bornholdt,et al.  Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[2]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[3]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.

[4]  R. Pastor-Satorras,et al.  Generation of uncorrelated random scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Beom Jun Kim,et al.  Growing scale-free networks with tunable clustering. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  R. J. Jessen.  Some Methods of Probability Non-Replacement Sampling , 1969 .

[7]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[8]  Behrouz Minaei-Bidgoli,et al.  ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks , 2016, SIGMOD Conference.

[9]  Pavlos S. Efraimidis,et al.  Weighted Random Sampling over Data Streams , 2010, Algorithms, Probability, Networks, and Games.

[10]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[11]  Pol Colomer-de-Simon,et al.  Clustering of random scale-free networks , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Amin Saberi,et al.  Asymptotic behavior and distributional limits of preferential attachment graphs , 2014, 1401.2792.

[13]  N. Butt.  Sampling with Unequal Probabilities , 2003 .

[14]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks: Volume 1 , 2016 .

[15]  Roe Goodman,et al.  Controlled Selection—A Technique in Probability Sampling , 1950 .

[16]  Pavlos S. Efraimidis,et al.  About Weighted Random Sampling in Preferential Attachment Models , 2021, ArXiv.

[17]  Ulrik Brandes,et al.  Efficient generation of large random networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.