Abstract

A random walk on an infinite tree is given a particular kind of positive feedback so edges already traversed are more likely to be traversed in the future. Using exchangeability theory, the process is shown to be equivalent to a random walk in a random environment (RWRE), that is to say, a mixture of Markov chains. Criteria are given to determine whether a RWRE is transient or recurrent. These criteria apply to show that the reinforced random walk can vary from transient to recurrent, depending on the value of an adjustable parameter measuring the strength of the feedback. The value of the parameter at the phase transition is calculated.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call