相关论文: Crossover behaviors in branching annihilating attr…
Self-attracting walks (SATW) with attractive interaction u > 0 display a swelling-collapse transition at a critical u_{\mathrm{c}} for dimensions d >= 2, analogous to the \Theta transition of polymers. We are interested in the structure of…
Branching random flights are key to describing the evolution of many physical and biological systems, ranging from neutron multiplication to gene mutations. When their paths evolve in bounded regions, we establish a relation between the…
Self-interacting random walks (SIRWs) show long-range memory effects that result from the interaction of the random walker at time $t$ with the territory already visited at earlier times $t'<t$. This class of non-Markovian random walks has…
We consider the two-dimensional simple random walk conditioned on never hitting the origin. This process is a Markov chain, namely it is the Doob $h$-transform of the simple random walk with respect to the potential kernel. It is known to…
The phase transitions to absorbing states of the branching-annihilating reaction-diffusion processes mA --> (m+k)A, nA --> (n-l)A are studied systematically in one space dimension within a new family of models. Four universality classes of…
We consider a branching-selection particle system on the real line. In this model the total size of the population at time $n$ is limited by $\exp\left(a n^{1/3}\right)$. At each step $n$, every individual dies while reproducing…
Cross-country soaring flights rely on intermittent atmospheric updrafts to cover long distances, producing trajectories that alternate between rapid relocation and local exploration. From a large dataset of paraglider, hang glider, and…
Weakly self-avoiding walk (WSAW) is a model of simple random walk paths that penalizes self-intersections. On $\mathbb{Z}$, Greven and den Hollander proved in 1993 that the discrete-time weakly self-avoiding walk has an asymptotically…
Self-avoiding walks (SAWs) were introduced in chemistry to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multiple occupation of the same spatial point. In mathematics, a…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
Our main goal is to study a class of processes whose increments are generated via a cellular automata rule. Given the increments of a simple biased random walk, a new sequence of (dependent) Bernoulli random variables is produced. It is…
We present the analytical and numerical results of a random walk on the family of small-world graphs. The average access time shows a crossover from the regular to random behavior with increasing distance from the starting point of the…
We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [Tadi\'c, Physica A {\bf 293},…
Particle hopping is a common feature in heterogeneous media. We explore such motion by using the widely applicable formalism of the continuous time random walk and focus on the statistics of rare events. Numerous experiments have shown that…
We study an active random walker model in which a particle's motion is determined by a self-generated field. The field encodes information about the particle's path history. This leads to either self-attractive or self-repelling behavior.…
Axis-driven random walks were introduced by P. Andreoletti and P. Debs [AD23] to provide a rough description of the behaviour of a particle trapped in a localized force field. In contrast to their work, we examine the scenario where a…
Random walks have been intensively studied on regular and complex networks, which are used to represent pairwise interactions. Nonetheless, recent works have demonstrated that many real-world processes are better captured by higher-order…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
The anyonic quantum walk is a dynamical model describing a single anyon propagating along a chain of stationary anyons and interacting via mutual braiding statistics. We review the recent results on the effects of braiding statistics in…
We show that particle transport in a uniform, quantum multi-baker map, is generically ballistic in the long time limit, for any fixed value of Planck's constant. However, for fixed times, the semi-classical limit leads to diffusion. Random…