activity
20082021
most citedLaws of the single logarithm for delayed sums of random fields

9 citations · 11 across the 5 of their papers we have counts for

collaborators

6 papers

math.PR2021

The Elephant random walk with gradually increasing memory

Allan Gut, Ulrich Stadtmüller

In the simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the Elephant random walk(ERW), which was introduced by Schuetz and Trimper in 2…

math.PR2020

The number of zeroes in Elephant random walks with delays

Allan Gut, Ulrich Stadtmüller

In the simple random walk the steps are independent, whereas in the Elephant Random Walk (ERW), which was introduced by Schütz and Trimper in 2004, the next step always depends on…

math.PR2019

Elephant random walks with delays

Allan Gut, Ulrich Stadtmüller

In the simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the Elephant Random walk (ERW), which was introduced by Schütz and Trimper in 2…

math.PR20151 cited

Generalized St. Petersburg games revisited

Allan Gut, Anders Martin-Löf

The topic of the present paper is a generalized St.\ Petersburg game in which the distribution of the payoff is given by , , where

math.PR20091 cited

Cesáro summation for random fields

Allan Gut, Ulrich Stadtmueller

Various methods of summation for divergent series of real numbers have been generalized to analogous results for sums of iid random variables. The natural extension of results corr…

math.ST20089 cited

Laws of the single logarithm for delayed sums of random fields

Allan Gut, Ulrich Stadtmüller

We extend a law of the single logarithm for delayed sums by Lai to delayed sums of random fields. A law for subsequences, which also includes the one-dimensional case, is obtained…