Ant-Based Clustering and Topographic Mapping
Artificial Life
Simulating a Random Walk with Constant Error
Combinatorics, Probability and Computing
Deterministic random walks on the integers
European Journal of Combinatorics
Walkers on the Cycle and the Grid
SIAM Journal on Discrete Mathematics
Deterministic random walks on the two-dimensional grid
Combinatorics, Probability and Computing
A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
SIAM Journal on Discrete Mathematics
Deterministic random walks on regular trees
Random Structures & Algorithms
A novel ant-based clustering algorithm using the kernel method
Information Sciences: an International Journal
Random walks, interacting particles, dynamic networks: randomness can be helpful
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Analysis of random walks using tabu lists
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
| Hi-index | 0.04 |
This paper studies deterministic movement over toroidal grids (and more generally, Cayley graphs on groups), integrating local information, bounded memory and choice at individual nodes. The research is motivated by recent work on deterministic random walks, and applications in multi-agent systems. Several results regarding passing tokens through toroidal grids are discussed, as well as some open questions.