Automated design of random dynamic graph models

Dynamic graphs are an essential tool for representing a wide variety of concepts that change over time. Examples include modeling the evolution of relationships and communities in a social network or tracking the activity of users within an enterprise computer network. In the case of static graph representations, random graph models are often useful for analyzing and predicting the characteristics of a given network. Even though random dynamic graph models are a trending research topic, the field is still relatively unexplored. The selection of available models is limited and manually developing a model for a new application can be difficult and time-consuming. This work leverages hyper-heuristic techniques to automate the design of novel random dynamic graph models. A genetic programming approach is used to evolve custom heuristics that emulate the behavior of a variety of target models with high accuracy. Results are presented that illustrate the potential for the automated design of custom random dynamic graph models.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  Henning Meyerhenke,et al.  Shape optimizing load balancing for MPI-parallel adaptive numerical simulations , 2012, Graph Partitioning and Graph Clustering.

[3]  Daniel R. Tauritz,et al.  Evolving random graph generators: A case for increased algorithmic primitive granularity , 2016, 2016 IEEE Symposium Series on Computational Intelligence (SSCI).

[4]  Xiao Zhang,et al.  Random graph models for dynamic networks , 2016, The European Physical Journal B.

[5]  Alexander D. Kent,et al.  Unified Host and Network Data Set , 2017, Security Science and Technology.

[6]  Kyle Robert Harrison.  Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming , 2014 .

[7]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[8]  David J. Montana,et al.  Strongly Typed Genetic Programming , 1995, Evolutionary Computation.

[9]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Alessandro Chessa,et al.  Group Recommendation with Automatic Identification of Users Communities , 2009, 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology.

[11]  Beatrice M. Ombuki-Berman,et al.  Automatic inference of graph models for directed complex networks using genetic programming , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[12]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[13]  Beatrice M. Ombuki-Berman,et al.  A meta-analysis of centrality measures for comparing and generating complex network models , 2016, J. Comput. Sci..

[14]  Mario Ventresca,et al.  Action-based Modeling of Complex Networks , 2017, Scientific Reports.

[15]  Aravind Srinivasan,et al.  Modelling disease outbreaks in realistic urban social networks , 2004, Nature.

[16]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[17]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[18]  Srinivasan Parthasarathy,et al.  Fast Change Point Detection on Dynamic Social Networks , 2017, IJCAI.

[19]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[20]  Camille Roth,et al.  Symbolic regression of generative network models , 2014, Scientific Reports.

[21]  Michael Richard Medland,et al.  Object-Oriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks , 2015 .