Related papers: Speed Function for Biased Random Walks with Traps
We consider the Bouchaud trap model on the integers in the case that the trap distribution has a slowly varying tail at infinity. Our main result is a functional limit theorem for the model under the annealed law, analogous to the…
It is classical to approximate the distribution of fractional Brownian motion by a renormalized sum $ S_n $ of dependent Gaussian random variables. In this paper we consider such a walk $ Z_n $ that collects random rewards $ \xi_j $ for $ j…
A continuous-time random walk in the quarter plane with homogeneous transition rates is considered. Given a non-negative reward function on the state space, we are interested in the expected stationary performance. Since a direct derivation…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
We consider the continuous time symmetric random walk with a slow bond on $\mathbb Z$, which rates are equal to $1/2$ for all bonds, except for the bond of vertices $\{-1,0\}$, which associated rate is given by $\alpha n^{-\beta}/2$, where…
This work presents global random walk approximations of solutions to one-dimensional Stefan-type moving-boundary problems. We are particularly interested in the case when the moving boundary is driven by an explicit representation of its…
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
Optimization of energy cost determines average values of spatio-temporal gait parameters such as step duration, step length or step speed. However, during walking, humans need to adapt these parameters at every step to respond to exogenous…
We construct random Morse functions on surfaces by random walk and compute related distributions. We study the space of Morse functions through these random variables. We consider subspaces characterized by the surfaces with boundary…
In this short note, we prove that $v(-\epsilon)=-v(\epsilon)$. Here, $v(\epsilon)$ is the speed of a one-dimensional random walk in a dynamic \emph{reversible} random environment, that jumps to the right (resp. to the left) with probability…
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…
A functional approach for the study of the random walks in random sceneries (RWRS) is proposed. Under fairly general assumptions on the random walk and on the random scenery, functional limit theorems are proved. The method allows to study…
Space-time correlation functions constitute a useful instrument from the research toolkit of continuous-media and many-body physics. We adopt here this concept for single-particle random walks and demonstrate that the corresponding…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
Let $\xi(k,n)$ be the local time of a simple symmetric random walk on the line. We give a strong approximation of the centered local time process $\xi(k,n)-\xi(0,n)$ in terms of a Wiener sheet and an independent Wiener process, time changed…
An algorithm (bliss) is proposed to speed up the construction of slow adaptive walks. Slow adaptive walks are adaptive walks biased towards closer points or smaller move steps. They were previously introduced to explore a search space, e.g.…
In this paper we prove that under certain assumptions the transient random walk in random environment with bounded jumps (in $\mathbb{Z}$) grows much slower than the speed $n$. Precisely, there is $0<s<1$, such that although $X_n\rto$ we…
For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…