Key points are not available for this paper at this time.
also with probability 1. This result is proved in ?5. The difficulty in proving lower bounds like (1.2) is that one has to consider all possible coverings of the path by small convex sets in the definition of 4-measure. In the past the only successful method has been to use the connection between Hausdorff measures and generalized capacities. The first result of this kind appears in 16 where it is proved that for k >2, the Hausdorff measure with respect to ta is infinite for all a 3 we obtain a law of the iterated logarithm for the total time Tk(a, co) spent by the path X in a sphere of radius a as a-* 0+. We also determine the local behavior of the first passage time Pk(a, co) out of a sphere of radius a for k > 1. In order to obtain the required asymptotic results we required good estimates of the distribution functions for the random variables Tk(a, co), Pk(a, c). We use the method developed by Mark Kac to compute these dis-
Building similarity graph...
Analyzing shared references across papers
Loading...
Z. Ciesielski
Samuel J. Taylor
Temple University
Transactions of the American Mathematical Society
Building similarity graph...
Analyzing shared references across papers
Loading...
Ciesielski et al. (Thu,) studied this question.
synapsesocial.com/papers/6a21e4c3109700e90a978752 — DOI: https://doi.org/10.1090/s0002-9947-1962-0143257-8