Self-Replicating Graphs
Self-Replicating Graphs
In these adaptive graph models, the vertices reproduce, while highly connected vertices die. Although the rules are simple, the models can generate highly complex behavior—a single edge can grow and break into thousands of different self-replicating structures. Every time step, the graph is updated by performing the "reproduction stage" and then the "killing stage". In the reproduction stage, every vertex has an "offspring vertex" that is born with the same connections as its parent. In the killing stage, every vertex with more connections than the "degree cap" gets destroyed. In model 1, offspring inherit their parent's neighborhood. In model 3, there is an extra "umbilical" connection between parent and offspring.