Dynamic graphs and continuous Boolean networks, II: Large-scale organic structures

In this paper, we propose a new method for constructing large-scale dynamic graphs. The procedure is based on the notion of graph entanglement, and involves “organic” operations such as self-replication and random mutations. Graphs obtained in this manner are globally asymptotically stable, and the simulation of their dynamics requires only a modest computational effort. As a result, they provide a suitable mathematical framework for studying the behavior of large-scale continuous Boolean networks.