Related papers: Optimum exploration memory and anomalous diffusion…
Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously…
In systems which exhibit deterministic diffusion, the gross parameter dependence of the diffusion coefficient can often be understood in terms of random walk models. Provided the decay of correlations is fast enough, one can ignore memory…
Despite having been studied for decades, first passage processes remain an active area of research. In this contribution we examine a particle diffusing in an annulus with an inner absorbing boundary and an outer reflective boundary. We…
We study the time until first occurrence, the first-passage time, of rare density fluctuations in diffusive systems. We approach the problem using a model consisting of many independent random walkers on a lattice. The existence of spatial…
We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…
We analyze the dynamics of random walks with long-term memory (binary chains with long-range correlations) in the presence of an absorbing boundary. An analytically solvable model is presented, in which a dynamical phase-transition occurs…
We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…
Wang et al. [PNAS 106 (2009) 15160] have found that in several systems the linear time dependence of the mean-square displacement (MSD) of diffusing colloidal particles, typical of normal diffusion, is accompanied by a non-Gaussian…
Anomalous diffusion occurs in many physical and biological phenomena, when the growth of the mean squared displacement (MSD) with time has an exponent different from one. We show that recurrent neural networks (RNN) can efficiently…
Random walks (RWs) are fundamental stochastic processes with applications across physics, computer science, and information processing. A recent extension, the laser chaos decision-maker, employs chaotic time series from semiconductor…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
A constrained diffusive random walk of n steps and a random flight in Rd, which can be expressed in the same terms, were investigated independently in recent papers. The n steps of the walk are identically and independently distributed…
We combine the processes of resetting and first-passage to define \emph{first-passage resetting}, where the resetting of a random walk to a fixed position is triggered by a first-passage event of the walk itself. In an infinite domain,…
Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…
A random walk is performed on a disordered landscape composed of $N$ sites randomly and uniformly distributed inside a $d$-dimensional hypercube. The walker hops from one site to another with probability proportional to $\exp [- \beta…
We study how the Hurst exponent $\alpha$ depends on the fraction $f$ of the total time $t$ remembered by non-Markovian random walkers that recall only the distant past. We find that otherwise nonpersistent random walkers switch to…
Random walks (RW) of particles adsorbed in the internal walls of porous deposits produced by ballistic-type growth models are studied. The particles start at the external surface of the deposits and enter their pores, in order to simulate…
We study a discrete-time quantum walk in presence of a detector at $x_D$ initially. The detector here is repeatedly removed after a span of $t_R$, the removal time, and reinserted at random locations. Two relocation rules are considered…
Motivated by the diffusion-reaction kinetics on interstellar dust grains, we study a first-passage problem of mortal random walkers in a confined two-dimensional geometry. We provide an exact expression for the encounter probability of two…
In this paper, we deal with a size-variable group of pedestrians moving in a unknown confined environment and searching for an exit. Pedestrian dynamics are simulated by means of a recently introduced microscopic (agent-based) model,…