Game-driven random walks: Survival time statistics
M.I. Krivonosov, S.N. Tikhomirov, S. Denisov

TL;DR
This paper investigates the survival time statistics of a game-based random walk model on a finite lattice, revealing complexities beyond standard random walk behavior through experiments with humans and autonomous agents.
Contribution
It introduces a game-driven random walk model and analyzes its survival time distribution, highlighting complexities not captured by traditional models.
Findings
Survival time distribution is more complex than standard random walks.
Experiments with humans and bots show similar complex patterns.
The model provides insights into organism movement patterns.
Abstract
Random walks are powerful tools to analyze spatial-temporal patterns produced by living organisms ranging from cells to humans. At the same time, it is evident that these patterns are not completely random but are results of a convolution of organisms' sensor-based information processing and motility. The complexity of the first component is reflected in the statistical characteristics of trajectories produced by an organism -- when it is, e.g., foraging or searching for a mate (or a pathogen) -- and therefore some knowledge about the component can be obtained by analyzing the trajectories with the standard toolbox of methods used for random walks. Here we consider trajectories which appear as the results of a game played by two players on a finite square lattice. One player wants to survive, i. e., to stay within the interior of the square, as long as possible while another one wants…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDiffusion and Search Dynamics
