Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-29T11:07:34.902Z Has data issue: false hasContentIssue false
  • English
  • Français

Tied Favourite Edges for Simple Random Walk

Published online by Cambridge University Press:  01 September 1997

B. TÓTH  and
W. WERNER
B. TÓTH
Affiliation:
Mathematical Institute of the Hungarian Academy of Sciences, POB 127, H-1364 Budapest, Hungary (e-mail: [email protected])
W. WERNER
Affiliation:
CNRS, Laboratoire de Mathématiques, ENS, 45, rue d'Ulm, F-75230 Paris cedex 05, France (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

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
Combinatorics, Probability and Computing , Volume 6 , Issue 3 , September 1997 , pp. 359 - 369
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)