Ant-Inspired Density Estimation via Random Walks
Cameron Musco, Hsin-Hao Su, Nancy Lynch

TL;DR
This paper provides a theoretical analysis of how agents performing random walks can estimate population density accurately through encounter rates, with implications for biology, social networks, and robotics.
Contribution
It introduces a novel theoretical framework for density estimation via random walks, accounting for dependencies and extending to general graphs.
Findings
Agents estimate density with small error in few steps
Analysis of dependencies in collision probabilities
Extension of results to general graphs
Abstract
Many ant species employ distributed population density estimation in applications ranging from quorum sensing [Pra05], to task allocation [Gor99], to appraisal of enemy colony strength [Ada90]. It has been shown that ants estimate density by tracking encounter rates -- the higher the population density, the more often the ants bump into each other [Pra05,GPT93]. We study distributed density estimation from a theoretical perspective. We prove that a group of anonymous agents randomly walking on a grid are able to estimate their density within a small multiplicative error in few steps by measuring their rates of encounter with other agents. Despite dependencies inherent in the fact that nearby agents may collide repeatedly (and, worse, cannot recognize when this happens), our bound nearly matches what would be required to estimate density by independently sampling grid locations. From…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
