The 'magic formula' for linearly edge-reinforced random walks
Seminar Room 1, Newton Institute
AbstractLinearly edge-reinforced random walk on a finite graph is a mixture of reversible Markov chains with an explicitly known mixing measure. We give a new proof of this fact. (Joint work with Silke Rolles).
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.