Volume 131, Number 4, August 2020
|Number of page(s)||5|
|Published online||07 September 2020|
How to generate the tip of branching random walks evolved to large times
1 Laboratoire de Physique de l'Écolenormale supérieure, ENS, Université PSL, CNRS, Sorbonne Université, Université de Paris - F-75005 Paris, France
2 CPHT, CNRS, École polytechnique, IP Paris - F-91128 Palaiseau, France
3 Department of Physics, Columbia University - New York, NY10027, USA
Received: 27 July 2020
Accepted: 1 August 2020
In a branching process, the number of particles increasesexponentially with time, which makes numerical simulations for large timesdifficult. In many applications, however, only the region close to the extremalparticles is relevant (the “tip”). We present a simple algorithmwhich allows to simulate a branching random walk in one dimension, keepingonly the particles that arrive within some distance of the rightmost particle ata predefined time T. The complexity of the algorithm growslinearly with T. We can furthermore choose to require that therealizations have their rightmost particle arbitrarily far on the right from itstypical position. We illustrate our algorithm by evaluating an observable forwhich no other practical method is known.
PACS: 02.50.-r – Probability theory, stochastic processes, and statistics / 05.40.-a – Fluctuation phenomena, random processes, noise, and Brownian motion / 05.10.Ln – Monte Carlo methods
© 2020 EPLA
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.