geoffroy-berthelot / random-walks

Random walks on 1, 2 or 3 dimensional graphs

Random walks on infinite graphs (/lattice) on multiple dimensions

This is the C++ code used for simulating random walks on infinite graphs (/lattice):

• only one random walker
• waiting time : the walker stops an amount of time \delta_h at each node/site
• waiting speed : the walker's speed
• perturbations (optional) including jumps, drift, short-term memory (the walker avoids returning to its precious node/site ), "empty" graph (/lattice) where each node has a probability to be already visited at initialization.

Please refer to the following article for more information:

(i) Bansaye, V., Berthelot, G., El Bachari, A., Chazottes, J. R., & Billiard, S. (2024). Stochastic foraging paths primarily drives within-species variations of prey consumption rates. bioRxiv, 2024-05. https://doi.org/10.1101/2024.05.29.596370

Please refer to the following Git repository for corresponding datasets :

(i) @sylvainbilliard https://github.com/sylvainbilliard