Parameter specification for the degree distribution of simulated Barabási–Albert graphs

The degree distribution of a simulated Barabasi–Albert graph under linear preferential attachment is investigated. Specifically, the parameters of the power law distribution are estimated and compared against the theoretical values derived using mean field theory. Least squares method and MLE-nonparametric method were utilized to estimate the distribution parameters on 1000 simulated Barabasi–Albert graphs for edge parameter m∈{2,4,6} and size n∈{2k:k=5,6,…,14,15}. Goodness of fit metrics were computed on a second set of simulated graphs for the median of the estimated parameters and other hypothetical values for the distribution parameters. The results suggest that the distribution of the parameters from simulated graphs are significantly different from the theoretical distribution and is also dependent on m. Further results confirm the finding that the parameter of the power law distribution, β, increases as m increases.

[1]  Dustin Arendt,et al.  More bang for your research buck: toward recommender systems for visual analytics , 2014, BELIV '14.

[2]  H. Simon,et al.  ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS , 1955 .

[3]  Brani Vidakovic,et al.  Nonparametric Statistics with Applications to Science and Engineering (Wiley Series in Probability and Statistics) , 2007 .

[4]  Lorenzo Livi,et al.  The graph matching problem , 2012, Pattern Analysis and Applications.

[5]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[6]  G. Yule,et al.  A Mathematical Theory of Evolution, Based on the Conclusions of Dr. J. C. Willis, F.R.S. , 1925 .

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

[8]  M. Small,et al.  Growing optimal scale-free networks via likelihood. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[10]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[11]  Piet Van Mieghem,et al.  Degree distribution and assortativity in line graphs of complex networks , 2016 .

[12]  Michael Small,et al.  Exactly scale-free scale-free networks , 2013, ArXiv.

[13]  M. Small,et al.  Emergence of scaling and assortative mixing through altruism , 2011 .

[14]  Zhi-Dan Zhao,et al.  Emergence of scaling in human-interest dynamics , 2013, Scientific Reports.

[15]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[16]  D J PRICE,et al.  NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.

[17]  Michael Small,et al.  How is that complex network complex? , 2014, 2014 IEEE International Symposium on Circuits and Systems (ISCAS).

[18]  Gábor Csárdi,et al.  The igraph software package for complex network research , 2006 .

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

[20]  Stephen E. Fienberg,et al.  A Brief History of Statistical Models for Network Analysis and Open Challenges , 2012 .

[21]  M. E. J. Newman,et al.  Power laws, Pareto distributions and Zipf's law , 2005 .