Optimization of random searches on regular lattices
- 31 October 2005
- journal article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 72 (4) , 046143
- https://doi.org/10.1103/physreve.72.046143
Abstract
We investigate random searches on isotropic and topologically regular square and triangular lattices with periodic boundary conditions and study the efficiency of search strategies based on a power-law distribution P() approximately (-mu) of step lengths . We consider both destructive searches, in which a target can be visited only once, and nondestructive searches, when a target site is always available for future visits. We discuss (i) the dependence of the search efficiency on the choice of the lattice topology, (ii) the relevance of the periodic boundary conditions, (iii) the behavior of the optimal power-law exponent mu(opt) as a function of target site density, (iv) the differences between destructive and nondestructive environments, and finally (v) how the results for the discrete searches differ from the continuous cases previously studied.Keywords
This publication has 22 references indexed in Scilit:
- Flow and Transport in Porous Media and Fractured RockPublished by Wiley ,2011
- Improvements in the statistical approach to random Lévy flight searchesPhysica A: Statistical Mechanics and its Applications, 2001
- Lévy flights in random searchesPhysica A: Statistical Mechanics and its Applications, 2000
- Optimizing the success of random searchesNature, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- Lévy flight search patterns of wandering albatrossesNature, 1996
- Fractal time in animal behaviour: the movement activity of DrosophilaAnimal Behaviour, 1995
- Memory search using complex dynamics in a recurrent neural network modelNeural Networks, 1993
- Foraging TheoryPublished by Walter de Gruyter GmbH ,1987
- Foraging BehaviorPublished by Springer Nature ,1987