Related papers: On large deviations for the range of a two-dimensi…

A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is…

We develop techniques to obtain rigorous bounds on the behaviour of random walks on combs. Using these bounds we calculate exactly the spectral dimension of random combs with infinite teeth at random positions or teeth with random but…

A simple symmetric random walk is considered on a spider that is a collection of half lines (we call them legs) joined at the origin. We establish a strong approximation of this random walk by the so-called Brownian spider. Transition…

We study the support (i.e. the set of visited sites) of a t step random walk on a two-dimensional square lattice in the large t limit. A broad class of global properties M(t) of the support is considered, including, e.g., the number S(t) of…

We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…

We derive asymptotic estimates for the velocity of random walks in random environments which are perturbations of the simple symmetric random walk but have a small local drift in a given direction. Our estimates complement previous results…

It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…

The probability distribution of the number $s$ of distinct sites visited up to time $t$ by a random walk on the fully-connected lattice with $N$ sites is first obtained by solving the eigenvalue problem associated with the discrete master…

Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…

We study arithmetic properties of short uniform random walks in arbitrary dimensions, with a focus on explicit (hypergeometric) evaluations of the moment functions and probability densities in the case of up to five steps. Somewhat to our…

We prove existence of the large deviation principle, with a proper convex rate function, for the distribution of the renormalized distance from the origin of a random walk on a free product of finitely generated groups. As a consequence, we…

A deterministic walk in a random environment can be understood as a general random process with finite-range dependence that starts repeating a loop once it reaches a site it has visited before. Such process lacks the Markov property. We…

We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…

We study the polygons governing the convex hull of a point set created by the steps of $n$ independent two-dimensional random walkers. Each such walk consists of $T$ discrete time steps, where $x$ and $y$ increments are i.i.d. Gaussian. We…

Random walk has wide applications in many fields, such as machine learning, biology, physics, and chemistry. Random walk can be discrete or continuous in time and space. Asymmetric random walk could be described by drift-diffusion equation.…

We consider the probability that a two-dimensional random walk starting from the origin never returns to the half-line $ (- \infty,0] \times {0}$ before time $n$. Let $X^{(1)}=(X_{1},X_{2})$ be the increment of the two-dimensional random…

This work is motivated by the study of some two-dimensional random walks in random environment (RWRE) with transition probabilities independent of one coordinate of the walk. These are non-reversible models and can not be treated by…

One can define a random walk on a hypercubic lattice in a space of integer dimension $D$. For such a process formulas can be derived that express the probability of certain events, such as the chance of returning to the origin after a given…

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

In this paper, we discuss asymptotic behavior of the capacity of the range of symmetric simple random walks on finitely generated groups. We show the corresponding strong law of large numbers and central limit theorem.