IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v90y2017i9d10.1140_epjb_e2017-80372-4.html
   My bibliography  Save this article

Comparison of pure and combined search strategies for single and multiple targets

Author

Listed:
  • Vladimir V. Palyulin

    (University of Cambridge)

  • Vladimir N. Mantsevich

    (Physics Department, Moscow State University)

  • Rainer Klages

    (Queen Mary University of London, School of Mathematical Sciences)

  • Ralf Metzler

    (Institute for Physics & Astronomy, University of Potsdam)

  • Aleksei V. Chechkin

    (Institute for Physics & Astronomy, University of Potsdam
    Akhiezer Institute for Theoretical Physics NSC KIPT)

Abstract

We address the generic problem of random search for a point-like target on a line. Using the measures of search reliability and efficiency to quantify the random search quality, we compare Brownian search with Lévy search based on long-tailed jump length distributions. We then compare these results with a search process combined of two different long-tailed jump length distributions. Moreover, we study the case of multiple targets located by a Lévy searcher.

Suggested Citation

  • Vladimir V. Palyulin & Vladimir N. Mantsevich & Rainer Klages & Ralf Metzler & Aleksei V. Chechkin, 2017. "Comparison of pure and combined search strategies for single and multiple targets," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 90(9), pages 1-16, September.
    • Handle: RePEc:spr:eurphb:v:90:y:2017:i:9:d:10.1140_epjb_e2017-80372-4
    DOI: 10.1140/epjb/e2017-80372-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1140/epjb/e2017-80372-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1140/epjb/e2017-80372-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Trifce Sandev & Viktor Domazetoski & Alexander Iomin & Ljupco Kocarev, 2021. "Diffusion–Advection Equations on a Comb: Resetting and Random Search," Mathematics, MDPI, vol. 9(3), pages 1-24, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:eurphb:v:90:y:2017:i:9:d:10.1140_epjb_e2017-80372-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.