Abstract
Dynamic graphs are an essential tool for representing a wide variety of concepts that change over time. 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 real-world dynamic networks.
Full Text
Topics from this Paper
Random Graph Models
Random Graph
Genetic Programming Approach
Dynamic Graph
Graph Models
+ Show 5 more
Create a personalized feed of these topics
Get StartedTalk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Oct 2, 2019
Journal of Applied Probability
Nov 11, 2022
Social Networks
May 1, 2007
Oct 29, 2020
ACM Computing Surveys
Jan 21, 2020
Acta Mathematicae Applicatae Sinica, English Series
Oct 1, 2020
Social Networks
May 1, 2007
Computer Science Review
Feb 1, 2021