English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

First passage and first hitting times of Levy flights and Levy walks

MPS-Authors
/persons/resource/persons246553

Blackburn,  George
Max Planck Institute for the Physics of Complex Systems, Max Planck Society;

/persons/resource/persons184654

Klages,  Rainer
Max Planck Institute for the Physics of Complex Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Palyulin, V. V., Blackburn, G., Lomholt, M. A., Watkins, N. W., Metzler, R., Klages, R., et al. (2019). First passage and first hitting times of Levy flights and Levy walks. New Journal of Physics, 21(10): 103028. doi:10.1088/1367-2630/ab41bb.


Cite as: https://hdl.handle.net/21.11116/0000-0005-F350-E
Abstract
For both Levy flight and Levy walk search processes we analyse the full distribution of first-passage and first-hitting (or first-arrival) times. These are, respectively, the times when the particle moves across a point at some given distance from its initial position for the first time, or when it lands at a given point for the first time. For Levy motions with their propensity for long relocation events and thus the possibility to jump across a given point in space without actually hitting it ('leapovers'), these two definitions lead to significantly different results. We study the first-passage and first-hitting time distributions as functions of the Levy stable index, highlighting the different behaviour for the cases when the first absolute moment of the jump length distribution is finite or infinite. In particular we examine the limits of short and long times. Our results will find their application in the mathematical modelling of random search processes as well as computer algorithms.