Attracting edge and strongly edge reinforced walks

The goal is to show that an edge-reinforced random, walk on a graph of bounded degree, with reinforcement weight function W taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting edge at all large times. The statement of the main theorem is...

Ausführliche Beschreibung

Bibliographische Detailangaben
Hauptverfasser: Limic, V, Tarres, P
Format: Journal article
Veröffentlicht: 2007