GitHub - ivanbelenky/pywalker: graph random walkish structure

1 min read Original article ↗

Repository files navigation

Walker

Something can emerge from this. At the moment just random walkish behavior.

env = simpy.Environment()
walker = Walker(env, random_decider, 3)
env.process(walker.run())
env.run(until=1000)

Transferer

Randomly connected graph with transfer rules for mass. Its like a brownian expansion of the nodes of the graph but with underlying stochastic rules. So it does not look totally cahotic. There is some conservation.

graph = FriendsTransferers(49, env, 100, size=(8,8))
env.process(graph.update())
env.run(until=2000)
graph.play_history(save=True, filepath='./assets/grid.gif')