Automated Design of Random Dynamic Graph Models

被引:2
|
作者
Pope, Aaron Scott [1 ,2 ]
Tauritz, Daniel R. [1 ]
Rawlings, Chris [2 ]
机构
[1] Missouri Univ Sci & Technol, Dept Comp Sci, Rolla, MO 65409 USA
[2] Los Alamos Natl Lab, Los Alamos, NM 87545 USA
关键词
Random graph models; dynamic graphs; genetic programming;
D O I
10.1145/3319619.3326859
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:1504 / 1512
页数:9
相关论文
共 50 条
  • [1] Automated Design of Random Dynamic Graph Models for Enterprise Computer Network Applications
    Pope, Aaron Scott
    Tauritz, Daniel R.
    Rawlings, Chris
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION), 2019, : 352 - 353
  • [2] Random graph models for dynamic networks
    Zhang, Xiao
    Moore, Cristopher
    Newman, Mark E. J.
    EUROPEAN PHYSICAL JOURNAL B, 2017, 90 (10):
  • [3] Random graph models for dynamic networks
    Xiao Zhang
    Cristopher Moore
    Mark E. J. Newman
    The European Physical Journal B, 2017, 90
  • [4] Models of random graph hierarchies
    Robert Paluch
    Krzysztof Suchecki
    Janusz A. Hołyst
    The European Physical Journal B, 2015, 88
  • [5] Models of random subtrees of a graph
    Fredes, Luis
    Marckert, Jean-Francois
    PROBABILITY SURVEYS, 2023, 20 : 722 - 801
  • [6] Models of random graph hierarchies
    Paluch, Robert
    Suchecki, Krzysztof
    Holyst, Janusz A.
    EUROPEAN PHYSICAL JOURNAL B, 2015, 88 (10):
  • [7] Exponential Random Graph Models
    Chatterjee, Sourav
    LARGE DEVIATIONS FOR RANDOM GRAPHS: ECOLE D'ETE DE PROBABILITES DE SAINT-FLOUR XLV - 2015, 2017, 2197 : 99 - 117
  • [8] Dynamic graph models
    Harary, F
    Gupta, G
    MATHEMATICAL AND COMPUTER MODELLING, 1997, 25 (07) : 79 - 87
  • [9] DYNAMIC RANDOM NETWORKS AND THEIR GRAPH LIMITS
    Crane, Harry
    ANNALS OF APPLIED PROBABILITY, 2016, 26 (02): : 691 - 721
  • [10] Random graph models of social networks
    Newman, MEJ
    Watts, DJ
    Strogatz, SH
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 : 2566 - 2572