Let Sn be the total gain in n repeated St. Petersburg games. It is known that n−1(Sn − n log2 n) converges in distribution along certain geometrically increasing subsequences and its possible limiting random variables can be parametrized as Y (t) with t ∈ [1/2, 1]. We determine the Hausdorff and box-counting dimension of the range and the graph for almost all sample paths of the stochastic process {Y(t)}t∈[1/2, 1]. The results are compared to the fractal dimension of the corresponding limiting objects when gains are given by a deterministic sequence initiated by Hugo Steinhaus.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
An integral analogue of the almost sure limit theorem is presented for semi-selfsimilar processes. In the theorem, instead of a sequence of random elements, a continuous time random process is involved; moreover, instead of the logarithmical average, the integral of delta-measures is considered. Then the theorem is applied to obtain almost sure limit theorems for semistable processes. Discrete versions of the above theorems are proved. In particular, the almost sure functional limit theorem is obtained for semistable random variables.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.