Papers
Topics
Authors
Recent
Search
2000 character limit reached

An elementary approach to Brownian local time based on simple, symmetric random walks

Published 10 Aug 2010 in math.PR | (1008.1701v1)

Abstract: In this paper we define Brownian local time as the almost sure limit of the local times of a nested sequence of simple, symmetric random walks. The limit is jointly continuous in $(t,x)$. The rate of convergence is $n{\frac14} (\log n){\frac34}$ that is close to the best possible. The tools we apply are almost exclusively from elementary probability theory.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.