Once edge-reinforced random walk on a tree
By R. Durrett, Harry Kesten, V. Limic. 2002
58 citations recorded by the source corpus.
Subfields: Condensed Matter Physics, Mathematical Physics, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/9ad2960b932eac629f73213d27c3ef53907e7bb4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Condensed Matter Physics
In Mathematical Physics
In Statistics and Probability
Citations in the corpus
- A survey of random processes with reinforcement (2006, methodology): “ase transition in ordinary ERRW on a tree, a once-reinforced ERRW is transient for every δ > 0 (in fact the same is true when “once” is replaced by “k times”). This was proved for regular trees in [DKL02] and extended to Galton-Watson trees in [Die05]. The only other graph for which I am aware of”