Related papers: A note on the intersections of two random walks in…
Elephant random walk, introduced to study the effect of memory on random walks, is a novel type of walk that incorporates the information of one randomly chosen past step to determine the future step. However, memory of a process can be…
As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…
The following random process on $\Z^4$ is studied. At first visit to a site, the two first coordinates perform a (2-dimensional) simple random walk step. At further visits, it is the last two coordinates which perform a simple random walk…
We consider the precise upper large deviations estimates for the maximal displacement of a branching random walk. In addition, we obtain a description of the extremal process of the branching random walk conditioned on this large deviations…
The aim of this short article is to convey the basic idea of the original paper [3], without going into too much detail, about how to derive sharp asymptotics of the gyration radius for random walk, self-avoiding walk and oriented…
We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random…
This paper works out the rate of convergence of two "natural" random walks on the dicyclic group.
We consider two models of one-dimensional random walks among biased i.i.d. random conductances: the first is the classical exponential tilt of the conductances, while the second comes from the effect of adding an external field to a random…
We consider random walks on $\Z^8$ indexed by the infinite invariant tree, which consists of an infinite spine and finite random trees attached to it on both sides. We establish the precise order of the non-intersection probability between…
In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…
We quantify superdiffusive transience for a two-dimensional random walk in which the vertical coordinate is a martingale and the horizontal coordinate has a positive drift that is a polynomial function of the individual coordinates and of…
In this paper, we deal with the inner boundary of random walk range, that is, the set of those points in a random walk range which have at least one neighbor site outside the range. If $L_n$ be the number of the inner boundary points of…
The goal of these notes is to fill some gaps in the literature about random walks in the Cauchy domain of attraction, which has been in many cases left aside because of its additional technical difficulties. We prove here several results in…
We investigate crossing path probabilities for two agents that move randomly in a bounded region of the plane or on a sphere (denoted $R$). At each discrete time-step the agents move, independently, fixed distances $d_1$ and $d_2$ at angles…
In this paper the multi-dimensional random walk models governed by distributed fractional order differential equations and multi-term fractional order differential equations are constructed. The scaling limits of these random walks to a…
We consider a random walk in random environment with random holding times, that is, the random walk jumping to one of its nearest neighbors with some transition probability after a random holding time. Both the transition probabilities and…
The study of several naturally arising "nearest neighbours" random walks benefits from the study of the associated orthogonal polynomials and their orthogonality measure. I consider extensions of this approach to a larger class of random…
Consider a transient near-critical (1,2) random walk on the positive half line. We give a criteria for the finiteness of the number of the skipped points (the points never visited) by the random walk. This result generalizes (partially) the…
Transport in complex systems is characterized by a fractal dimension -- the walk dimension -- that indicates the diffusive or anomalous nature of the underlying random walk process. Here we report on the experimental retrieval of this key…
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…