On the Effectiveness of the Block Two-Level Erdős-Rényi Generative Network Model

Complex network models have been continuously improved to better match and understand the structural properties and features of real world networks. Such models are useful to generate sample networks with similar characteristics of real world networks that can then be used to improve algorithms and, at the same time, safeguard real data. Several models have been studied and developed over the last few years aiming at matching features like heavy-tailed degree distributions, low diameter and community structure. However, the BTER model is one of a few which was shown capable of generating synthetic networks with all the main characteristics of a real-world network. BTER is capable to match any real degree distribution and clustering coefficient. However, very few experiments have been carried out to support such a claim. In this work, we examine several different parameter setups and then show that the BTER is capable of matching various degree distributions. However, BTER is not capable to correspond to the desired clustering coefficients when restrictions such as connectivity are added to a given network. Further, we also show that the degree distribution plays an important role in the clustering coefficients, independently of how they are parameterized in the model.

[1]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[2]  M. Newman,et al.  Why social networks are different from other types of networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  M. Jacomy,et al.  ForceAtlas 2 , A Continuous Graph Layout Algorithm for Handy Network Visualization , 2012 .

[4]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

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

[6]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Yves Zenou,et al.  From Assortative to Dissortative Networks: The Role of Capacity Constraints , 2010, Adv. Complex Syst..

[8]  John A. Stankovic,et al.  Research Directions for the Internet of Things , 2014, IEEE Internet of Things Journal.

[9]  Paul Erdös,et al.  On random graphs, I , 1959 .

[10]  Antonio Alfredo Ferreira Loureiro,et al.  Understanding the role of mobility in real mobile ad-hoc networks connectivity , 2017, 2017 IEEE Symposium on Computers and Communications (ISCC).

[11]  Yves Zenou,et al.  Nestedness in Networks: A Theoretical Model and Someapplications , 2012 .

[12]  Antonio Iera,et al.  From "smart objects" to "social objects": The next evolutionary step of the internet of things , 2014, IEEE Communications Magazine.

[13]  Luís C. Lamb,et al.  Memetic Networks: Analyzing the Effects of Network Properties in Multi-Agent Performance , 2008, AAAI.

[14]  Luís C. Lamb,et al.  On approximating networks centrality measures via neural learning algorithms , 2016, 2016 International Joint Conference on Neural Networks (IJCNN).

[15]  Tamara G. Kolda,et al.  A Scalable Generative Graph Model with Community Structure , 2013, SIAM J. Sci. Comput..

[16]  Jiang Zhu,et al.  Fog Computing: A Platform for Internet of Things and Analytics , 2014, Big Data and Internet of Things.

[17]  Michael Kearns,et al.  Experiments in social computation , 2012, KDD.

[18]  Luís C. Lamb,et al.  Collaboration in Social Problem-Solving: When Diversity Trumps Network Efficiency , 2015, AAAI.

[19]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.