论文信息 - Vertex-reinfoced random walk on Z visits finitely many states

Vertex-reinfoced random walk on Z visits finitely many states

Vertex-reinforced random walk is defined in Pemantle's (1988) thesis; it is a random walk that is biased to visit sites it has already visited a lot. We show that this reinforcement scheme, in contrast to the scheme of edge-reinforcement, causes random walk on a line to get trapped in a finite set.

R. Pemantle | S. Volkov | Robin Pemantle

[1] Hans G. Othmer,et al. Aggregation, Blowup, and Collapse: The ABC's of Taxis in Reinforced Random Walks , 1997, SIAM J. Appl. Math..

[2] W. Sudderth,et al. Polya Trees and Random Distributions , 1992 .

[3] R. Pemantle,et al. Vertex-reinforced random walk , 1992, math/0404041.

[4] Robin Pemantle,et al. Phase transition in reinforced random walk and RWRE on trees , 1988 .

[5] W. Brian Arthur,et al. Path-dependent processes and the emergence of macro-structure , 1987 .

[6] Carlos S. Kubrusly,et al. Stochastic approximation algorithms and applications , 1973, CDC 1973.

[7] D. Blackwell,et al. Ferguson Distributions Via Polya Urn Schemes , 1973 .

[8] D. Freedman. Bernard Friedman's Urn , 1965 .

[9] W. Feller. An Introduction to Probability Theory and Its Applications , 1959 .

[10] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .

[11] B. Friedman,et al. A simple urn model , 1949 .

[12] G. Pólya,et al. Über die Statistik verketteter Vorgänge , 1923 .

[13] M. Greenwood,et al. An Inquiry into the Nature of Frequency Distributions Representative of Multiple Happenings with Particular Reference to the Occurrence of Multiple Attacks of Disease or of Repeated Accidents , 1920 .