Related papers: Universal record statistics for random walks and L…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
Identifying statistical patterns characterizing human trajectories is crucial for public health, traffic engineering, city planning, and epidemic modeling. Recent developments in global positioning systems and mobile phone networks have…
We study the problem of detecting a random walk on a graph from a sequence of noisy measurements at every node. There are two hypotheses: either every observation is just meaningless zero-mean Gaussian noise, or at each time step exactly…
Let $S_n =X_1+\cdots +X_n$ be an irreducible random walk (r.w.) on the one dimensional integer lattice with zero mean, infinite variance and i.i.d. increments $X_n$. We obtain an upper and lower bounds of the potential function, $a(x)$, of…
We consider $N$ Brownian motions diffusing independently on a line, starting at $x_0>0$, in the presence of an absorbing target at the origin. The walkers undergo stochastic resetting under two protocols: (A) each walker resets…
We define the probability structure of a continuous-time time-homogeneous Markov jump process, on a finite graph, that represents the continuous-time counterpart of the so-called Ruelle-Bowen discrete-time random walk. It constitutes the…
Two random-walk related problems which have been studied independently in the past, the expected maximum of a random walker in one dimension and the flux to a spherical trap of particles undergoing discrete jumps in three dimensions, are…
In this note we give various characterizations of random walks with possibly different steps that have relatively large discrepancy from the uniform distribution modulo a prime p, and use these results to study the distribution of the rank…
We consider annihilating random walks on the finite one-dimensional integer torus with deposition of pairs of particles, conditioned on an atypical jump activity. All cumulants of the activity, defined as the number of particle jumps up to…
This article considers the statistical properties of L\'evy walks possessing a regular long-term linear scaling of the mean square displacement with time, for which the conditions of the classical Central Limit Theorem apply.…
We consider a simple random walk W_i in 1 or 2 dimensions, in which the walker may choose to stand still for a limited time. The time horizon is n, the maximum consecutive time steps which can be spent standing still is m_n and the goal is…
We consider one-dimensional discrete-time random walks (RWs) in the presence of finite size traps of length $\ell$ over which the RWs can jump. We study the survival probability of such RWs when the traps are periodically distributed and…
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…
The random walk problem is studied in two and three dimensions in the presence of a random distribution of static traps. An efficient Monte Carlo method, based on a mapping onto a polymer model, is used to measure the survival probability…
We extend the pseudorandomness of random walks on expander graphs using the sticky random walk. Building on prior works, it was recently shown that expander random walks can fool all symmetric functions in total variation distance (TVD)…
We define the Uniform Random Walk (URW) on a connected, locally finite graph as the weak limit of the uniform walk of length $n$ starting at a fixed vertex. When the limit exists, it is necessarily Markovian and is independent of the…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…
We consider a discrete-time random walk on a line starting at $x_0\geq 0$ where a cost is incurred at each jump. We obtain an exact analytical formula for the distribution of the total cost of a trajectory until the process crosses the…
We investigate the effects of markovian resseting events on continuous time random walks where the waiting times and the jump lengths are random variables distributed according to power law probability density functions. We prove the…