Probabilistic pursuits on graphs

DOI10.1016/j.tcs.2019.08.001zbMath1431.68086arXiv1710.08107OpenAlexW2766709638MaRDI QIDQ2330128

Michael Amir, Alfred Marcel Bruckstein

Publication date: 18 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.08107

zbMATH Keywords

gridspseudo-modular graphsgrid geometrychain pursuitsmulti-agent pursuitsprobabilistic multi-agent systems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov chains and stochastic stability
• On rigid circuit graphs
• The role of information in the cop-robber game
• Pseudo-modular graphs
• Algorithmic graph theory and perfect graphs
• Why the ant trails look so straight and nice
• Ant Local Search and its efficient adaptation to graph colouring
• Slicing an ear using prune-and-search
• Probabilistic Pursuits on the Grid

This page was built for publication: Probabilistic pursuits on graphs