Related papers: Activated Random Walks on $\mathbb{Z}$ with Critic…
We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite or infinite) connected graph, so that each particle has…
The frog model is a system of interacting random walks. Initially, there is one particle at each vertex of a connected graph $\mathcal{G}$. All particles are inactive at time zero, except for the one which is placed at the root of…
We consider symmetric activated random walks on $\mathbb{Z}$, and show that the critical density $\zeta_c$ satisfies $c\sqrt{\lambda} \leq \zeta_c(\lambda) \leq C \sqrt{\lambda}$ where $\lambda$ denotes the sleep rate.
Branching processes are widely used to model the viral epidemic evolution. For more adequate investigation of viral epidemic modelling, we suggest to apply branching processes with transport of particles usually called branching random…
We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given…
Understanding how biological and synthetic systems achieve robust function in noisy environments remains a fundamental challenge across the physical and life sciences. To connect robust behavior with non-trivial topological features present…
We consider the activated random walk particle system, a model of self-organized criticality, on $\mathbb{Z}$ with i.i.d.-Bernoulli initial configuration. We show that at subcritical density, the system's odometer function, which counts the…
Based on a martingale theory approach, we present a complete characterization of the asymptotic behaviour of a lazy reinforced random walk (LRRW) which shows three different regimes (diffusive, critical and superdiffusive). This allows us…
We study the dynamics of a radioactive species flowing through a porous material, within the Continuous-Time Random Walk (CTRW) approach to the modelling of stochastic transport processes. Emphasis is given to the case where radioactive…
Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited…
We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…
Background: This study is mainly motivated by the need of understanding how the diffusion behaviour of a biomolecule (or even of a larger object) is affected by other moving macromolecules, organelles, and so on, inside a living cell,…
We investigate the dynamics of a particle executing a general Continuous Time Random Walk (CTRW) in three dimensions under the influence of arbitrary time-varying external fields. Contrary to the general approach in recent works, our method…
We show that the critical density for activated random walk on $\mathbb{Z}^d$ approaches the sleep probability as $d \to \infty$ and provide the first-order correction.
Applied to statistical physics models, the random cost algorithm enforces a Random Walk (RW) in energy (or possibly other thermodynamic quantities). The dynamics of this procedure is distinct from fixed weight updates. The probability for a…
The damped random walk (DRW) model is increasingly used to model the variability in quasar optical light curves, but it is still uncertain whether the DRW model provides an adequate description of quasar optical variability across all time…
We propose a new model of self-organized criticality. A particle is dropped at random on a lattice and moves along directions specified by arrows at each site. As it moves, it changes the direction of the arrows according to fixed rules. On…
We consider a non-Markovian discrete-time random walk on $\mathbb{Z}$ with unbounded memory called the elephant random walk (ERW). We prove a strong invariance principle for the ERW. More specifically, we prove that, under a suitable…
Quantum random walks (QRWs) are random processes in which the resulting probability density of the "walker" state, whose movement is governed by a "coin" state, is described in a non-classical manner. Previously, Q-plates have been used to…
Standard continuous time random walk (CTRW) models are renewal processes in the sense that at each jump a new, independent pair of jump length and waiting time are chosen. Globally, anomalous diffusion emerges through action of the…