No CrossRef data available.
Published online by Cambridge University Press: 17 February 2009
A one-sided one-dimensional random walk with repulsion from the origin is solved exactly. The walk imitates the self-avoiding walk problem insofar as the mean end-to-end distance of an n-step walk tends asymptotically to n as n tends to infinity.