Inverse square Levy walk emerging universally in goal-oriented tasks

05/23/2023
by   Shuji Shinohara, et al.
0

The Levy walk in which the frequency of occurrence of step lengths follows a power-law distribution, can be observed in the migratory behavior of organisms at various levels. Levy walks with power exponents close to 2 are observed, and the reasons are unclear. This study aims to propose a model that universally generates inverse square Levy walks (called Cauchy walks) and to identify the conditions under which Cauchy walks appear. We demonstrate that Cauchy walks emerge universally in goal-oriented tasks. We use the term "goal-oriented" when the goal is clear, but this can be achieved in different ways, which cannot be uniquely determined. We performed a simulation in which an agent observed the data generated from a probability distribution in a two-dimensional space and successively estimated the central coordinates of that probability distribution. The agent has a model of probability distribution as a hypothesis for data-generating distribution and can modify the model such that each time a data point is observed, thereby increasing the estimated probability of occurrence of the observed data. To achieve this, the center coordinates of the model must be moved closer to those of the observed data. However, in the case of a two-dimensional space, arbitrariness arises in the direction of correction of the center; this task is goal oriented. We analyze two cases: a strategy that allocates the amount of modification randomly in the x- and y-directions, and a strategy that determines allocation such that movement is minimized. The results reveal that when a random strategy is used, the Cauchy walk appears. When the minimum strategy is used, the Brownian walk appears. The presence or absence of the constraint of minimizing the amount of movement may be a factor that causes the difference between Brownian and Levy walks.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
06/25/2020

A random walk on Area Restricted Search

These notes from a graduate class at the Unuversidad Autonoma de Madrid ...
research
09/13/2022

Space-Efficient Random Walks on Streaming Graphs

Graphs in many applications, such as social networks and IoT, are inhere...
research
12/17/2018

Combinatorics of nondeterministic walks of the Dyck and Motzkin type

This paper introduces nondeterministic walks, a new variant of one-dimen...
research
04/15/2021

How to Teach a Quantum Computer a Probability Distribution

Currently there are three major paradigms of quantum computation, the ga...
research
06/09/2016

Hypergeometric Expressions for Generating Functions of Walks with Small Steps in the Quarter Plane

We study nearest-neighbors walks on the two-dimensional square lattice, ...
research
07/15/2020

Network navigation using Page Rank random walks

We introduce a formalism based on a continuous time approximation, to st...

Please sign up or login with your details

Forgot password? Click here to reset