Once edge-reinforced random walk on a tree

被引：0

作者：

Rick Durrett

Harry Kesten

Vlada Limic

机构：

[1] Department of Mathematics,

[2] Malott Hall,undefined

[3] Cornell University,undefined

[4] Ithaca,undefined

[5] NY 14853,undefined

[6] USA. e-mail: rtd1@cornell.edu; kesten@math.cornell.edu; limic@math.cornell.edu,undefined

来源：

Probability Theory and Related Fields | 2002年 / 122卷

关键词：

Random Walk; Invariance Principle; Linear Rate; Regular Tree; Neighbor Walk;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We consider a nearest neighbor walk on a regular tree, with transition probabilities proportional to weights or conductances of the edges. Initially all edges have weight 1, and the weight of an edge is increased to $c > 1$ when the edge is traversed for the first time. After such a change the weight of an edge stays at $c$ forever. We show that such a walk is transient for all values of $c \ge 1$, and that the walk moves off to infinity at a linear rate. We also prove an invariance principle for the height of the walk.

引用

页码：567 / 592

页数：25