A toy simulation where shared graph nodes make competing loops unstable
I made a small toy simulation about competing loops on a graph.
The setup is simple: there are three loops. In one version, each loop has its own separate nodes. In another version, some nodes are shared between loops.
That small change made the behavior much less stable.
When the loops were separated, one loop would usually win and stay dominant for a while. But when two intermediate nodes were shared, the dominant loop started switching much more often. The system also spent more time in mixed states where no single loop was clearly winning.
There is no explicit “switch loops” rule in the code. The switching seems to come from the graph structure itself: shared routes make the loops interfere with each other.
This is not meant to be a neuroscience model or a new theory. It is just a small simulation / sandbox for looking at how shared structure can change the behavior of competing feedback loops.
Repo: https://github.com/idlestate-dev/EchoLoop
Does this resemble any existing toy model or concept in complex systems / dynamical systems?