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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
