For , the number of blocks is finite almost surely. On a finite restriction, the expected time to reach blocks is at most . Markov inequality, followed by increasing the restriction, gives . Let , then use rational times and monotonicity to obtain the assertion simultaneously for every .

Articles by others on the same topic (0)

There are currently no matching articles.