Generating discrete-time constrained random walks and Lévy flights - Archive ouverte HAL Access content directly
Journal Articles Physical Review E Year : 2021

Generating discrete-time constrained random walks and Lévy flights

Abstract

We introduce a method to exactly generate bridge trajectories for discrete-time random walks, with arbitrary jump distributions, that are constrained to initially start at the origin and return to the origin after a fixed time. The method is based on an effective jump distribution that implicitly accounts for the bridge constraint. It is illustrated on various jump distributions and is shown to be very efficient in practice. In addition, we show how to generalize the method to other types of constrained random walks such as generalized bridges, excursions, and meanders.
Fichier principal
Vignette du fichier
2104.06145 (1.07 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03388308 , version 1 (16-12-2023)

Identifiers

Cite

Benjamin de Bruyne, Satya N. Majumdar, Grégory Schehr. Generating discrete-time constrained random walks and Lévy flights. Physical Review E , 2021, 104 (2), ⟨10.1103/PhysRevE.104.024117⟩. ⟨hal-03388308⟩
16 View
29 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More