Joint invariance principles for random walks with positively and negatively reinforced steps
Marco Bertenghi, Alejandro Rosales-Ortiz

TL;DR
This paper establishes Gaussian limit theorems for positively and negatively reinforced random walks with centered steps, using martingale methods, revealing their asymptotic behavior under certain reinforcement probabilities.
Contribution
It provides the first functional limit theorems for coupled positive and negative reinforced random walks with centered steps, expanding understanding of their asymptotic Gaussian behavior.
Findings
Limiting processes are Gaussian and can be represented via stochastic integrals.
Results hold for reinforcement probability p<1/2 and centered steps.
Method combines martingale approach with functional CLT.
Abstract
Given a random walk with typical step distributed according to some fixed law and a fixed parameter , the associated positively step-reinforced random walk is a discrete-time process which performs at each step, with probability , the same step as while with probability , it repeats one of the steps it performed previously chosen uniformly at random. The negatively step-reinforced random walk follows the same dynamics but when a step is repeated its sign is also changed. In this work, we shall prove functional limit theorems for the triplet of a random walk, coupled with its positive and negative reinforced versions when and when the typical step is centred. As our work will show, the limiting process is Gaussian and admits a simple representation in terms of stochastic integrals. Our method exhausts a martingale approach in conjunction with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Bayesian Methods and Mixture Models
