Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-09T09:39:35.901Z 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: balint@math-inst.hu)
W. WERNER
Affiliation:
CNRS, Laboratoire de Mathématiques, ENS, 45, rue d'Ulm, F-75230 Paris cedex 05, France (e-mail: wwerner@dmi.ens.fr)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 6 , Issue 3 , September 1997 , pp. 359 - 369
Copyright
1997 Cambridge University Press