Brownian Intersections, Cover Times and Thick Points via Trees

摘要

There is a close connection between intersections of Brownian motion paths and percolation on trees. Recently, ideas from probability on trees were an important component of the multifractal analysis of Brownian occupation measure, in joint work with A. Dembo, J. Rosen and O. Zeitouni. As a consequence, we proved two conjectures about simple random walk in two dimensions: The first, due to Erdos and Taylor (1960), involves the number of visits to the most visited lattice site in the first n steps of the walk. The second, due to Aldous (1989), concerns the number of steps it takes a simple random walk to cover all points of the n by n lattice torus. The goal of the lecture is to relate how methods from probability on trees can be applied to random walks and Brownian motion in Euclidean space.