We present a scalable and dimension‐insensitive simulation algorithm in which dimensionality is taken care of by not enumerating the agents' configurations; scalability is obtained by storing all potential events. This results in a simulation event cost which is purely logarithmic in the static measure of the rule set (number and size of rules) and opens the way for an implementation which can handle systems which are both large and high‐dimensional.

This content is only available via PDF.
You do not currently have access to this content.