Answers are grounded in this paper and cite their sources.
Linearly 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.
No takes yet. Share an insight, caveat, or question.
Merkl et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: