Abstract: We consider a self-attracting random walk in dimension d=1, in presence of a field of strength s, which biases the walker toward a target site. We focus on the dynamic case (true reinforced random walk), where memory effects are implemented at each time step, differently from the static case, where memory effects are accounted for globally. We analyze in details the asymptotic long-time behavior of the walker through the main statistical quantities (e.g. distinct sites visited, end-to-end distance) and we discuss a possible mapping between such dynamic self-attracting model and the trapping problem for a simple random walk, in analogy with the static model. Moreover, we find that, for any s>0, the random walk behavior switches to ballistic and that field effects always prevail on memory effects without any singularity, already in d=1; this is in contrast with the behavior observed in the static model.
Recommendations
Cites work
- A Guide to First-Passage Processes
- A survey of random processes with reinforcement
- Aggregation, Blowup, and Collapse: The ABC's of Taxis in Reinforced Random Walks
- Asymptotics for the wiener sausage
- Diffusive behaviour of self-attractive walks
- scientific article; zbMATH DE number 841532 (Why is no real title available?)
- On the number of distinct sites visited by a random walk
- Reinforced random walk
- The statistical mechanics of stretched polymers
- Transition to localization of biased walkers in a randomly absorbing environment
Cited in
(3)
This page was built for publication: The true reinforced random walk with bias
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137665)
