Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7381494 | Physica A: Statistical Mechanics and its Applications | 2014 | 8 Pages |
Abstract
Recently, we proposed a new random walk algorithm, termed the REV algorithm, in which the agent alters the directional rule that governs it using the most recent four random numbers. Here, we examined how a non-bounded number, i.e., “randomness” regarding move direction, was important for optimal searching and power-law distributed step lengths in rule change. We proposed two algorithms: the REV and REV-bounded algorithms. In the REV algorithm, one of the four random numbers used to change the rule is non-bounded. In contrast, all four random numbers in the REV-bounded algorithm are bounded. We showed that the REV algorithm exhibited more consistent power-law distributed step lengths and flexible searching behavior.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematical Physics
Authors
Tomoko Sakiyama, Yukio-Pegio Gunji,