About: Efficiency of search for randomly distributed targets is a prominent problem in many branches of the sciences. For the stochastic process of L/'evy walks, a specific range of optimal efficiencies was suggested under variation of search intrinsic and extrinsic environmental parameters. In this article, we study fractional Brownian motion as a search process, which under parameter variation generates all three basic types of diffusion, from sub- to normal to superdiffusion. In contrast to L/'evy walks, fractional Brownian motion defines a Gaussian stochastic process with power law memory yielding anti-persistent, respectively persistent motion. Computer simulations of this search process in a uniformly random distribution of targets show that maximising search efficiencies sensitively depends on the definition of efficiency, the variation of both intrinsic and extrinsic parameters, the perception of targets, the type of targets, whether to detect only one or many of them, and the choice of boundary conditions. We find that different search scenarios favour different modes of motion for optimising search success, defying a universality across all search situations. Some of our results are explained by a simple analytical model. Having demonstrated that search by fractional Brownian motion is a truly complex process, we propose an over-arching conceptual framework based on classifying different search scenarios. This approach incorporates search optimisation by L/'evy walks as a special case.   Goto Sponge  NotDistinct  Permalink

An Entity of Type : fabio:Abstract, within Data Space : wasabi.inria.fr associated with source document(s)

AttributesValues
type
value
  • Efficiency of search for randomly distributed targets is a prominent problem in many branches of the sciences. For the stochastic process of L/'evy walks, a specific range of optimal efficiencies was suggested under variation of search intrinsic and extrinsic environmental parameters. In this article, we study fractional Brownian motion as a search process, which under parameter variation generates all three basic types of diffusion, from sub- to normal to superdiffusion. In contrast to L/'evy walks, fractional Brownian motion defines a Gaussian stochastic process with power law memory yielding anti-persistent, respectively persistent motion. Computer simulations of this search process in a uniformly random distribution of targets show that maximising search efficiencies sensitively depends on the definition of efficiency, the variation of both intrinsic and extrinsic parameters, the perception of targets, the type of targets, whether to detect only one or many of them, and the choice of boundary conditions. We find that different search scenarios favour different modes of motion for optimising search success, defying a universality across all search situations. Some of our results are explained by a simple analytical model. Having demonstrated that search by fractional Brownian motion is a truly complex process, we propose an over-arching conceptual framework based on classifying different search scenarios. This approach incorporates search optimisation by L/'evy walks as a special case.
subject
  • Exponentials
  • Power laws
  • Statistical laws
  • Theory of probability distributions
  • Stable distributions
  • Lévy processes
  • Autocorrelation
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software