by 
EL1 2
ANSWERS: 1
-
I'm not totally certain, because this is more advanced than I ever studied BUT, I think it works like this: random walk on Z, a particle sits on an integer n, and with probability p, jumps to n+1, and with probability q, jumps to n-1. This part I do know. reinforced random walk. Each edge of the transition graph has a weight, initially one. Every time an edge is traversed, the weight is incresed by one. the probability of traversing an edge_i is weight_i/sum weight_j where weight_j are the weights of all available edges. once reinforced random walk: same again, except the increase in weight happens once only. Once reinforced random walk on Z: the transition edges are those between adjacent integers. The weights all start as one. When, for example, you traverse the edge from 0 to 1, the weight is increased by one. This makes it twice as likely the particle will return to 0 than continue to 2. (Assuming a non directed transition graph)
RELATED QUESTIONS
Copyright 2023, Wired Ivy, LLC