Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Claims

../

2024_09_02_hao_li_okada_zheng: Proves that planar simple random walk has exactly three favorite sites infinitely often with probability one and four or more only finitely often, so the asked probability is 1 for r = 3 and 0 for r at least 4; refereed.