Article contents
Tied Favourite Edges for Simple Random Walk
Published online by Cambridge University Press: 01 September 1997
Abstract
We show that there are almost surely only finitely many times at which there are at least four ‘tied’ favourite edges for a simple random walk. This (partially) answers a question of Erdős and Révész.
- Type
- Research Article
- Information
- Copyright
- 1997 Cambridge University Press
- 4
- Cited by