相关论文: Span observables - "When is a foraging rabbit no l…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
We consider the statistics of occupation times, the number of visits at the origin and the survival probability for a wide class of stochastic processes, which can be classified as renewal processes. We show that the distribution of these…
The distribution of times $t_{j,N}$ elapsed until the first $j$ independent random walkers from a set of $N \gg 1$, all starting from the same site, are trapped by a quenched configuration of traps randomly placed on a disordered lattice is…
We consider a random sequential adsorption process on the one-dimensional lattice with nearest-neighbor exclusion. In this model, each site $s \in \mathbb{Z}$ starts empty and we will try to occupy it in time $t_s$, where…
We study the random walk in random environment on {0,1,2,...}, where the environment is subject to a vanishing (random) perturbation. The two particular cases we consider are: (i) random walk in random environment perturbed from Sinai's…
We study the dynamics of a starving random walk in general spatial dimension $d$. This model represents an idealized description for the fate of an unaware forager whose motion is not affected by the presence or absence of resources. The…
We consider the branching random walk on the real line where the underlying motion is of a simple random walk and branching is at least binary and at most decaying exponentially in law. It is well known that the normalized empirical measure…
We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
Suppose that a $d$-dimensional domain is filled with a gas of (in general, interacting) diffusive particles with density $n_0$. A particle is absorbed whenever it reaches the domain boundary. Employing macroscopic fluctuation theory, we…
We study the first passage statistics to adsorbing boundaries of a Brownian motion in bounded two-dimensional domains of different shapes and configurations of the adsorbing and reflecting boundaries. From extensive numerical analysis we…
We study a simple model of a foraging animal that modifies the substrate on which it moves. This substrate provides its only resource, and the forager manage it by taking a limited portion at each visited site. The resource recovers its…
In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…
We study the convex hull of the set of points visited by a two-dimensional random walker of T discrete time steps. Two natural observables that characterize the convex hull in two dimensions are its perimeter L and area A. While the mean…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
We consider a continuous time random walk on the rooted binary tree of depth $n$ with all transition rates equal to one and study its cover time, namely the time until all vertices of the tree have been visited. We prove that, normalized by…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
The standard diffusive spreading, characterized by a Gaussian distribution with mean square displacement that grows linearly with time, can break down, for instance, under the presence of correlations and heterogeneity. In this work, we…
We study the number of distinct sites S_N(t) and common sites W_N(t) visited by N independent one dimensional random walkers, all starting at the origin, after t time steps. We show that these two random variables can be mapped onto extreme…
We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…