Related papers: Slowdown estimates for one-dimensional random walk…
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
We consider the small deviation probability for random walk with time-inhomogeneous random environment. Compared with the result in Mogul'ski\u{\i} (1974) for the i.i.d. random walk, the rate is smaller (due to the random environment),…
The statistics of persistent events, recently introduced in the context of phase ordering dynamics, is investigated in the case of the 1D lattice random walk in discrete time. We determine the survival probability of the random walker in…
We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…
We study the asymptotic behaviour of occupation times of a transient random walk in quenched random environment on a strip in a sub-diffusive regime. The asymptotic behaviour of hitting times, which is a more traditional object of study, is…
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…
Symmetric heavily tailed random walks on $Z^d, d\geq 1,$ are considered. Under appropriate regularity conditions on the tails of the jump distributions, global (i.e., uniform in $x,t, |x|+t\to\infty,$) asymptotic behavior of the transition…
We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…
In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general approach to analyzing these strategies by defining the dynamics…
This paper considers 1-dimensional generalized random walks in random scenery. That is, the steps of the walk are generated by an arbitrary stationary process, and also the scenery is a priori arbitrary stationary. Under an ergodicity…
We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…
We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…
We study the dynamics of a deterministic walk confined in a narrow two-dimensional space randomly filled with point-like targets. At each step, the walker visits the nearest target not previously visited. Complex dynamics is observed at…
We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…
A transient stochastic process is considered strongly transient if conditioned on returning to the starting location, the expected time it takes to return the the starting location is finite. We characterize strong transience for a…
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…
We study the speed of a biased random walk on a percolation cluster on $\Z^d$ in function of the percolation parameter $p$. We obtain a first order expansion of the speed at $p=1$ which proves that percolating slows down the random walk at…
We consider a random walk among i.i.d. obstacles on the one dimensional integer lattice under the condition that the walk starts from the origin and reaches a remote location y. The obstacles are represented by a killing potential, which…
We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…