Papers
Topics
Authors
Recent
2000 character limit reached

Lévy flights with power-law absorption (1409.4453v2)

Published 15 Sep 2014 in cond-mat.stat-mech

Abstract: We consider a particle performing a stochastic motion on a one-dimensional lattice with jump widths distributed according to a power-law with exponent $\mu + 1$. Assuming that the walker moves in the presence of a distribution $a(x)$ of targets (traps) depending on the spatial coordinate $x$, we study the probability that the walker will eventually find any target (will eventually be trapped). We focus on the case of power-law distributions $a(x) \sim x{-\alpha}$ and we find that as long as $\mu < \alpha$ there is a finite probability that the walker will never be trapped, no matter how long the process is. This analytical result, valid on infinite chains, is corroborated by numerical simulations which also evidence the emergence of slow searching (trapping) times in finite-size system. The extension of this finding to higher-dimensional structures is also discussed.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.