scholarly journals Limit Distributions of Directionally Reinforced Random Walks

1998 ◽  
Vol 134 (2) ◽  
pp. 367-383 ◽  
Author(s):  
Lajos Horváth ◽  
Qi-Man Shao
2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Michel Nguyên Thê

International audience This paper gives a survey of the limit distributions of the areas of different types of random walks, namely Dyck paths, bilateral Dyck paths, meanders, and Bernoulli random walks, using the technology of generating functions only.


2020 ◽  
Vol 178 (3-4) ◽  
pp. 1173-1192 ◽  
Author(s):  
Jean Bertoin

Abstract A reinforcement algorithm introduced by Simon (Biometrika 42(3/4):425–440, 1955) produces a sequence of uniform random variables with long range memory as follows. At each step, with a fixed probability $$p\in (0,1)$$ p ∈ ( 0 , 1 ) , $${\hat{U}}_{n+1}$$ U ^ n + 1 is sampled uniformly from $${\hat{U}}_1, \ldots , {\hat{U}}_n$$ U ^ 1 , … , U ^ n , and with complementary probability $$1-p$$ 1 - p , $${\hat{U}}_{n+1}$$ U ^ n + 1 is a new independent uniform variable. The Glivenko–Cantelli theorem remains valid for the reinforced empirical measure, but not the Donsker theorem. Specifically, we show that the sequence of empirical processes converges in law to a Brownian bridge only up to a constant factor when $$p<1/2$$ p < 1 / 2 , and that a further rescaling is needed when $$p>1/2$$ p > 1 / 2 and the limit is then a bridge with exchangeable increments and discontinuous paths. This is related to earlier limit theorems for correlated Bernoulli processes, the so-called elephant random walk, and more generally step reinforced random walks.


2010 ◽  
Vol 47 (02) ◽  
pp. 572-585 ◽  
Author(s):  
Netta Cohen ◽  
Jonathan Jordan ◽  
Margaritis Voliotis

We consider a preferential duplication model for growing random graphs, extending previous models of duplication graphs by selecting the vertex to be duplicated with probability proportional to its degree. We show that a special case of this model can be analysed using the same stochastic approximation as for vertex-reinforced random walks, and show that ‘trapping’ behaviour can occur, such that the descendants of a particular group of initial vertices come to dominate the graph.


2002 ◽  
Vol 335 (11) ◽  
pp. 941-946 ◽  
Author(s):  
Nathanaël Enriquez ◽  
Christophe Sabot

Sign in / Sign up

Export Citation Format

Share Document