Skip to main content

Tied Favourite Edges for Simple Random Walk

  • B. TÓTH (a1) and W. WERNER (a2)
    • Published online: 01 September 1997

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.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed