Reinforced random walks with geometric inter-transition times

Abstract

We consider interacting vertex-reinforced random walks on a finite graph, where each walk transitions at independent geometric random times with parameter pi ∈ (0,1]. The transition matrix of walk i takes the form Qi(x, pi) = pi Πi(x) + (1-pi)I, where πi(x) is the unique invariant measure, independently of pi. Consequently, the limiting points of the occupation measure X(n) coincide with those of the simultaneous-transition model (pi = 1): the solutions of x = π(x). Verifying almost sure convergence to these points is non-trivial, since the stochastic input U(n+1) is not a martingale difference. We address this by decomposing U(n) into a convergent martingale, a geometrically decaying component (1-p)U(n-1), and a controlled correction, allowing us to verify the Clark-Kushner condition and establish almost sure convergence.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…