相关论文: Three favorite sites occurs infinitely often for o…

In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…

In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…

The aim of this paper is the study of the strong local survival property for discrete-time and continuous-time branching random walks. We study this property by means of an infinite dimensional generating function G and a maximum principle…

We offer theoretical explanations for some recent observations in numerical simulations of quantum random walks (QRW). Specifically, in the case of a QRW on the line with one particle (walker) and two entangled coins, we explain the…

We consider excited random walks on the integers with a bounded number of i.i.d. cookies per site which may induce drifts both to the left and to the right. We extend the criteria for recurrence and transience by M. Zerner and for…

The dynamical discrete web is a system of one-dimensional coalescing random walks that evolves in an extra dynamical time parameter. At any deterministic dynamical time, the paths behave as coalescing simple symmetric random walks. This…

We consider the Bouchaud trap model on the integers in the case that the trap distribution has a slowly varying tail at infinity. We prove that the model eventually localises on exactly two sites with overwhelming probability. This is a…

A random walk in $Z_+^2$ spatially homogeneous in the interior, absorbed at the axes, starting from an arbitrary point $(i_0,j_0)$ and with step probabilities drawn on Figure 1 is considered. The trivariate generating function of…

Strong theorems are given for the maximal local time on balls and subspaces for the $d$-dimensional simple symmetric random walk.

We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…

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 statistics of first-passage times of random walks to target sites has proved to play a key role in determining the kinetics of space exploration in various contexts. In parallel, the number of distinct sites visited by a random walker…

We consider an infinite system of particles in one dimension, each particle performs independant Sinai's random walk in random environment. Considering an instant $t$, large enough, we prove a result in probability showing that the…

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

In this paper we study some properties of random walks perturbed at extrema, which are generalizations of the walks considered e.g., in Davis (1999). This process can also be viewed as a version of {\em excited random walk}, studied…

We consider one infinite path of a Random Walk in Random Environment (RWRE, for short) in an unknown environment. This environment consists of either i.i.d.\ site or bond randomness. At each position the random walker stops and tells us the…

We define a random walk on the set of primitive points of $\mathbb{Z}^d$. We prove that for walks generated by measures satisfying mild conditions these walks are recurrent in a strong sense. That is, we show that the associated Markov…

A L\'evy random medium, in a given space, is a random point process where the distances between points, a.k.a. targets, are long-tailed. Random walks visiting the targets of a L\'evy random medium have been used to model many (physical,…

There are two theories describing the linearizability of 3-webs: one is developed in the article "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp.2643-2654) and another in the article "On the Blaschke conjecture for…

Consider a critical nearest neighbor branching random walk on the $d$-dimensional integer lattice initiated by a single particle at the origin. Let $G_{n}$ be the event that the branching random walk survives to generation $n$. We obtain…