We consider the random walk of a particle on the two-dimensional integer lattice starting at the origin and moving from each site (independently of the previous moves) with equal probabilities to any of the 4 nearest neighbours. When τi denotes the even number of steps between the (i-1)-st and i-th return to the origin, we shall prove that the geometric mean of τ1,...,τn divided by npi converges in distribution to some positive random variable having a logarithmic stable law. We also obtain a rate of this convergence and improve an asymptotic estimate of the tail probability of τ1 due to Erdös and Taylor (1960)
The recurrence features of persistent random walks built from variable length Markov chains are inve...
Random recurrence relations are stochastic difference equations, which define recursively a sequence...
We consider random walks on the line given by a sequence of independent identically distributed jump...
We consider the random walk of a particle on the two-dimensional integer lattice starting at the ori...
We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., rando...
We consider random walks on the line given by a sequence of independent identically distributed jump...
Abstract. Under some mild condition, a random walk in the plane is recurrent. In particular each tra...
Let {Sn, n [epsilon] N)} be a simple random walk and denote by An its time average: An = (S1+ ...+Sn...
AbstractRenewal-like results and stability theorems relating to the large-time behaviour of a random...
International audienceWe consider a walker on the line that at each step keeps the same direction wi...
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition pr...
AbstractIn part I we proved for an arbitrary one-dimensional random walk with independent increments...
Abstract. We study the support (i.e. the set of visited sites) of a t-step random walk on a two-dime...
We analyse a model of random walk on a two-dimensional lattice and on a strip where the probabilitie...
We consider random walks with transition probabilities depending on the number of consecutive traver...
The recurrence features of persistent random walks built from variable length Markov chains are inve...
Random recurrence relations are stochastic difference equations, which define recursively a sequence...
We consider random walks on the line given by a sequence of independent identically distributed jump...
We consider the random walk of a particle on the two-dimensional integer lattice starting at the ori...
We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., rando...
We consider random walks on the line given by a sequence of independent identically distributed jump...
Abstract. Under some mild condition, a random walk in the plane is recurrent. In particular each tra...
Let {Sn, n [epsilon] N)} be a simple random walk and denote by An its time average: An = (S1+ ...+Sn...
AbstractRenewal-like results and stability theorems relating to the large-time behaviour of a random...
International audienceWe consider a walker on the line that at each step keeps the same direction wi...
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition pr...
AbstractIn part I we proved for an arbitrary one-dimensional random walk with independent increments...
Abstract. We study the support (i.e. the set of visited sites) of a t-step random walk on a two-dime...
We analyse a model of random walk on a two-dimensional lattice and on a strip where the probabilitie...
We consider random walks with transition probabilities depending on the number of consecutive traver...
The recurrence features of persistent random walks built from variable length Markov chains are inve...
Random recurrence relations are stochastic difference equations, which define recursively a sequence...
We consider random walks on the line given by a sequence of independent identically distributed jump...