Abstract
<!-- *** Custom HTML *** --> We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the random walk on infinite graphs. On trees, one has a representation as a random walk in an independent random environment. We review recent results for the random walk on ladders: recurrence, a representation as a random walk in a random environment, and estimates for the position of the random walker.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
