  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.
