Last time I presented a simple, limited class of agent-based models where each agent independently hops around a graph. I wrote:
Today the probability for an agent to hop from one vertex of the graph to another by going along some edge will be determined the moment the agent arrives at that vertex. It will depend only on the agent and the various edges leaving that vertex. Later I’ll want this probability to depend on other things too—like whether other agents are at some vertex or other. ...
Published on February 28, 2024 13:09