Localization of reinforced random walks

Details Localization of reinforced random walks Localization of reinforced random walks

2011-03-29

arxiv.org/abs/1103.5536v1

Mathematics

Probability

5 figures

Scientific paper

We describe and analyze how reinforced random walks can eventually localize, i.e. only visit finitely many sites. After introducing vertex and edge self-interacting walks on a discrete graph in a general setting, and stating the main results and conjectures so far on the topic, we present martingale techniques that provide an alternative proof of the a.s. localization of vertex-reinforced random walks (VRRWs) on the integers on finitely many sites and, with positive probability, on five consecutive sites, initially proved by Pemantle and Volkov (1999). Next we introduce the continuous time-lines representation (sometimes called Rubin construction) and its martingale counterpart, and explain how it has been used to prove localization of some reinforced walks on one attracting edge. Then we show how a modified version of this construction enables one to propose a new short proof of the a.s. localization of VRRWs on five sites on Z.

Affiliated with

Also associated with

No associations

Rating

Localization of reinforced random walks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Localization of reinforced random walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Localization of reinforced random walks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-162635