How edge-reinforced random walk arises naturally
type: Item
instance of: scholarly article
title: How edge-reinforced random walk arises naturally
zbMATH Open document ID: 1029.60089
author: Silke W. W. Rolles
publication date: 2003-08-20T00:00:00Z
review text: The paper concerns the random walk on locally finite graph. It is introduced a notion of partial exchangeability and it is given a characterization of the random walk in terms of this notion, i.e., it is proved a theorem relating the fact that the random walk is a unique mixture of reversible Markov chains with the partial exchangeability condition. The second result concerns the case in which the graph is \(2\)-edge-connected. Under some assumptions on the nearest neighbor random walk on \(G\) it is proved that the random walk is an edge-reinfoced random walk or a non-reinfoced random walk. This result is obtained by introducing the definition of modified edge-reinfoced random walk and proving his characterization in terms of certain partially exchangeable sequences.
Mathematics Subject Classification ID: 60K37
Mathematics Subject Classification ID: 60G09
zbMATH DE Number: 1968521
zbMATH Keywords: partial exchangeability
zbMATH Keywords: nearest neighbor random walk
zbMATH Keywords: edge-reinforced random walk
zbMATH Keywords: partially exchangeable sequences
reviewed by: A. Pellegrinotti
MaRDI profile type: Publication
full work available at URL: s00440-003-0260-8
OpenAlex ID: W2041480004
DOI: 10.1007/S00440-003-0260-8
published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete
description: scientific article; zbMATH DE number 1968521