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 条
  • [21] On Dimension in Graph Convolutional Networks for Distinguishing Random Graph Models
    Magner, Abram
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 1817 - 1822
  • [22] LOCAL GRAPH STABILITY IN EXPONENTIAL FAMILY RANDOM GRAPH MODELS
    Yu, Yue
    Grazioli, Gianmarc
    Phillips, Nolan E.
    Butts, Carter T.
    SIAM JOURNAL ON APPLIED MATHEMATICS, 2021, 81 (04) : 1389 - 1415
  • [23] Sandwiching random graphs: universality between random graph models
    Kim, JH
    Vu, VH
    ADVANCES IN MATHEMATICS, 2004, 188 (02) : 444 - 469
  • [24] Bipartite exponential random graph models with nodal random effects
    Kevork, Sevag
    Kauermann, Goeran
    SOCIAL NETWORKS, 2022, 70 : 90 - 99
  • [25] Bayesian exponential random graph models with nodal random effects
    Thiemichen, S.
    Friel, N.
    Caimo, A.
    Kauermann, G.
    SOCIAL NETWORKS, 2016, 46 : 11 - 28
  • [26] Diagnosing Multicollinearity in Exponential Random Graph Models
    Duxbury, Scott W.
    SOCIOLOGICAL METHODS & RESEARCH, 2021, 50 (02) : 491 - 530
  • [27] Exponential random graph models for multilevel networks
    Wang, Peng
    Robins, Garry
    Pattison, Philippa
    Lazega, Emmanuel
    SOCIAL NETWORKS, 2013, 35 (01) : 96 - 115
  • [28] Random graph models for directed acyclic networks
    Karrer, Brian
    Newman, M. E. J.
    PHYSICAL REVIEW E, 2009, 80 (04)
  • [29] On connectivity in random graph models with limited dependencies
    Lengler, Johannes
    Martinsson, Anders
    Petrova, Kalina
    Schnider, Patrick
    Steiner, Raphael
    Weber, Simon
    Welzl, Emo
    RANDOM STRUCTURES & ALGORITHMS, 2024, 65 (02) : 411 - 448
  • [30] Directed network Laplacians and random graph models
    Gong, Xue
    Higham, Desmond J.
    Zygalakis, Konstantinos
    ROYAL SOCIETY OPEN SCIENCE, 2021, 8 (10):