Almost sure convergence for stochastically biased random walks on trees

Details Almost sure convergence for stochastically biased random walks on trees Almost sure convergence for stochastically biased random walks on trees

2010-03-29

arxiv.org/abs/1003.5505v5

Mathematics

Probability

Scientific paper

10.1007/s00440-011-0379-y

We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random; the resulting random walk is then a tree-valued random walk in random environment. We investigate the recurrent case, and prove, under suitable general integrability assumptions, that upon the system's non-extinction, the maximal displacement of the walk in the first n steps, divided by (log n)^3, converges almost surely to a known positive constant.

Affiliated with

Also associated with

No associations

Rating

Almost sure convergence for stochastically biased random walks on trees 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 Almost sure convergence for stochastically biased random walks on trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost sure convergence for stochastically biased random walks on trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499639