Jump to ContentJump to Main Navigation
First Steps in Random WalksFrom Tools to Applications$
Users without a subscription are not able to see the full content.

J. Klafter and I. M. Sokolov

Print publication date: 2011

Print ISBN-13: 9780199234868

Published to Oxford Scholarship Online: December 2013

DOI: 10.1093/acprof:oso/9780199234868.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 25 November 2020

Coupled CTRW and Lévy walks

Coupled CTRW and Lévy walks

Chapter:
(p.110) 8 Coupled CTRW and Lévy walks
Source:
First Steps in Random Walks
Author(s):

J. Klafter

I.M. Sokolov

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199234868.003.0008

The divergent moments of Levy flights are often considered as a handicap for using this model in physics. The remedy is introducing the space‐time coupling, i.e. taking into account that in most applications a long step takes longer time to perform. The chapter starts from discussing different coupling schemes, and than concentrates on a special model, Levy walk, in which the time cost is proportional to a distance covered. A further generalization is given by a model where such Levy walk is interrupted by rests due to trapping events. Both Levy walks and walks interrupted by rests are relevant for description of experimental situations which are also shortly discussed.

Keywords:   space‐time coupled CTRW, Levy walks, Levy walks with rests, transport

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .