Abstract
Consider two random walks on . The transition probabilities of each walk is dependent on trajectory of the other walker i.e. a drift is obtained in a position the other walker visited twice or more. This simple model has a speed which is, according to simulations, not monotone in , without apparent "trap" behaviour. In this paper we prove the process has positive speed for , and present a deterministic algorithm to approximate the speed and show the non-monotonicity.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.