Ant-Inspired Density Estimation via Random Walks

DOI10.1145/2933057.2933106MaRDI QIDQ5361971zbMATH OpenOpenAlexFDO

Authors Cameron Musco, Hsin-Hao Su, Nancy Lynch

Publication date 29 September 2017

Published in Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2933057.2933106

zbMATH Keywords

ant colony algorithmsbiological distributed algorithmsnetwork-size estimationrandom walks

Mathematics Subject Classification ID

Random walks on graphs (05C81) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15) Animal behavior (92D50)

Recommendations

• Ant-inspired density estimation via random walks
• The directed edge reinforced random walk: the Ant Mill phenomenon
• Traffic of Ants on a Trail: A Stochastic Modelling and Zero Range Process
• On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
• Scaling limit for the ant in high-dimensional labyrinths
• Ant colony optimization based on random walk for community detection in complex networks
• Using Markov-chain mixing time estimates for the analysis of ant colony optimization

Cited in

(3)

• Ant-inspired density estimation via random walks
• Limits for rumor spreading in stochastic populations
• How Do Mobile Agents Benefit from Randomness?

This page was built for publication: Ant-Inspired Density Estimation via Random Walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361971)