Facets (new session)
Description
Metadata
Settings
owl:sameAs
Inference Rule:
b3s
b3sifp
dbprdf-label
facets
http://dbpedia.org/resource/inference/rules/dbpedia#
http://dbpedia.org/resource/inference/rules/opencyc#
http://dbpedia.org/resource/inference/rules/umbel#
http://dbpedia.org/resource/inference/rules/yago#
http://dbpedia.org/schema/property_rules#
http://www.ontologyportal.org/inference/rules/SUMO#
http://www.ontologyportal.org/inference/rules/WordNet#
http://www.w3.org/2002/07/owl#
ldp
oplweb
skos-trans
virtrdf-label
None
About:
Search efficiency of fractional Brownian motion in a random distribution of targets
Goto
Sponge
NotDistinct
Permalink
An Entity of Type :
schema:ScholarlyArticle
, within Data Space :
wasabi.inria.fr
associated with source
document(s)
Type:
Academic Article
research paper
schema:ScholarlyArticle
New Facet based on Instances of this Class
Attributes
Values
type
Academic Article
research paper
schema:ScholarlyArticle
isDefinedBy
Covid-on-the-Web dataset
title
Search efficiency of fractional Brownian motion in a random distribution of targets
Creator
Khadem, J
Klages, Rainer
Klapp, Sabine
Mohsen, S
source
ArXiv
abstract
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.
has issue date
2020-07-15
(
xsd:dateTime
)
has license
arxiv
sha1sum (hex)
4f0afb1ec5dd0daa4a1fa06cb66d96de33a9f9f9
resource representing a document's title
Search efficiency of fractional Brownian motion in a random distribution of targets
resource representing a document's body
covid:4f0afb1ec5dd0daa4a1fa06cb66d96de33a9f9f9#body_text
is
schema:about
of
named entity 'REF'
named entity 'PROCESS'
named entity 'PERSISTENT'
named entity 'PROMINENT'
named entity 'OUR'
»more»
◂◂ First
◂ Prev
Next ▸
Last ▸▸
Page 1 of 5
Go
Faceted Search & Find service v1.13.91 as of Mar 24 2020
Alternative Linked Data Documents:
Sponger
|
ODE
Content Formats:
RDF
ODATA
Microdata
About
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