A random walk on Area Restricted Search

06/25/2020
by   Simone Santini, et al.
0

These notes from a graduate class at the Unuversidad Autonoma de Madrid analyze a search behavior known as Area Resticted Search (ARS), widespread in the animal kingdom, and optimal when the resources that one is after are "patchy". In the first section we study the importance of the behavior in animal and its dependence on the dopamine as a indicator of reward. In the second section we put together a genetic algorithm to determine the optimality of ARS and its characteristics. Finally, we relate ARS to a type of random walks known as "Levy Walks", in which the probability of jumping at a distance d from the current location follows a power law distribution.

READ FULL TEXT
research
07/15/2020

Network navigation using Page Rank random walks

We introduce a formalism based on a continuous time approximation, to st...
research
08/09/2020

Random Walks: A Review of Algorithms and Applications

A random walk is known as a random process which describes a path includ...
research
05/23/2023

Inverse square Levy walk emerging universally in goal-oriented tasks

The Levy walk in which the frequency of occurrence of step lengths follo...
research
07/13/2018

Pairwise Independent Random Walks can be Slightly Unbounded

A family of problems that have been studied in the context of various st...
research
11/29/2022

Elfs, trees and quantum walks

We study an elementary Markov process on graphs based on electric flow s...
research
03/29/2020

The Search Efficiency of Intermittent Lévy walks Optimally Scales with Target Size

We address the general question of what is the best strategy to employ w...
research
04/03/2020

On the Search Efficiency of Parallel Lévy Walks on Z^2

Lévy walk is a popular movement model where an agent repeatedly samples ...

Please sign up or login with your details

Forgot password? Click here to reset