IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v314y2002i1p208-213.html
   My bibliography  Save this article

Lévy flight random searches in biological phenomena

Author

Listed:
  • Viswanathan, G.M
  • Bartumeus, F
  • V. Buldyrev, Sergey
  • Catalan, J
  • Fulco, U.L
  • Havlin, Shlomo
  • da Luz, M.G.E
  • Lyra, M.L
  • Raposo, E.P
  • Eugene Stanley, H

Abstract

There has been growing interest in the study of Lévy flights observed in the movements of biological organisms performing random walks while searching for other organisms. Here, we approach the problem of what is the best statistical strategy for optimizing the encounter rate between “searcher” and “target” organisms—either of the same or of different species—in terms of a limiting generalized searcher–target model (e.g., predator-prey, mating partner, pollinator–flower). In this context, we discuss known results showing that for fixed targets an inverse square density distribution of step lengths can optimize the encounter rate. For moving targets, we review how the encounter rate depends on whether organisms move in Lévy or Brownian random walks. We discuss recent findings indicating that Lévy walks confer a significant advantage for increasing encounter rates only when the searcher is larger or moves rapidly relative to the target, and when the target density is low.

Suggested Citation

  • Viswanathan, G.M & Bartumeus, F & V. Buldyrev, Sergey & Catalan, J & Fulco, U.L & Havlin, Shlomo & da Luz, M.G.E & Lyra, M.L & Raposo, E.P & Eugene Stanley, H, 2002. "Lévy flight random searches in biological phenomena," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 314(1), pages 208-213.
  • Handle: RePEc:eee:phsmap:v:314:y:2002:i:1:p:208-213
    DOI: 10.1016/S0378-4371(02)01157-3
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437102011573
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/S0378-4371(02)01157-3?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. Mishra, SK, 2012. "Global optimization of some difficult benchmark functions by cuckoo-hostco-evolution meta-heuristics," MPRA Paper 40615, University Library of Munich, Germany.

    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:eee:phsmap:v:314:y:2002:i:1:p:208-213. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.