Searcharxiv⌕ Search

arXiv subjects

Allan Gut

Publications and source records attributed to Allan Gut.

9 recordsLinked to original sources
arXiv2021

The Elephant random walk with gradually increasing memory

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 2004, the next step always depends on the whole path so far. Various authors have studied further properties of the ERW. In an earlier paper we studied the case when the Elephant remembers only a finite part of the first or last steps. In both cases there was no separation into two different regimes as in the classical ERW. We also posed the question about what happens if she remembers a gradually increasing past. This paper will give some answers to that question. We also discuss related questions for ERW:s with delays.

math.PR↗
arXiv2020

The number of zeroes in Elephant random walks with delays

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 the whole path so far. In an earlier paper we investigated Elephant Random Walks when the elephant has a restricted memory. Inspired by a suggestion by Bercu et al. (arXiv:1902.11220v1) we extended our results to the case when delays are allowed. In this paper we examine how the number of delays (that possibly stop the process) increases as time goes by.

math.PR↗
arXiv2019

Elephant random walks with delays

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 2004, the walker remembers the whole past, and the next step always depends on the whole path so far. One extension, as suggested in a recent paper by Bercu et al. (arXiv:1902.11220v1), is to allow for delays, that is, to put mass at zero. Our aim is to extend known result for the ordinary ERW to a Random Walk With Delays (ERWD).

math.PR↗
arXiv2018

Variations of the elephant random walk

In the classical simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the elephant random walk which was introduced by Schütz and Trimper in 2004, the walker remembers the whole past, and the next step always depends on the whole path so far. Our main aim is to prove analogous results when the elephant has only a restricted memory, for example remembering only the most remote step(s), the most recent step(s) or both. We also extend the models to cover more general step sizes.

math.PR↗
arXiv2015

Generalized St. Petersburg games revisited

The topic of the present paper is a generalized St.\ Petersburg game in which the distribution of the payoff $X$ is given by $P(X=sr^{k-1})=pq^{k-1}$, $k=1,2,\ldots$, where $p+q=1$, and $s,\,r>0$. As for main results, we first extend Feller's classical weak law and Martin-Löf's 1985-theorem on convergence in distribution along the $2^n$-subsequence. In his 2008-paper Martin-Löf considers a truncated version of the game and the problem "How much does one gain until 'game over'\,", and a variation where the player can borrow money but has to pay interest on the capital, also for the classical setting. We extend these problems to our more general setting. We close with some additional results and remarks.

math.PR↗
arXiv2010

Between the LIL and the LSL

In two earlier papers, two of the present authors (A.G. and U.S.) extended Lai's [Ann. Probab. 2 (1974) 432--440] law of the single logarithm for delayed sums to a multiindex setting in which the edges of the $\mathbf{n}$th window grow like $|\mathbf {n}|^α$, or with different $α$'s, where the $α$'s belong to $(0,1)$. In this paper, the edge of the $n$th window typically grows like $n/\log n$, thus at a higher rate than any power less than one, but not quite at the LIL-rate.

math.ST↗
arXiv2009

On the LSL for random fields

In some earlier work we have considered extensions of Lai's (1974) law of the single logarithm for delayed sums to a multiindex setting with the same as well as different expansion rates in the various dimensions. A further generalization concerns window sizes that are regularly varying with index 1 (on the line). In the present paper we establish multiindex versions of the latter as well as for some mixtures of expansion rates. In order to keep things within reasonable size we confine ourselves to some special cases for the index set $\mathbb{Z}_+^2$.

math.PR↗
arXiv2009

Cesáro summation for random fields

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 corresponding to Cesàro summation amounts to proving almost sure convergence of the Cesàro means. In the present paper we extend such results as well as weak laws and results on complete convergence to random fields, more specifically to random variables indexed by $\mathbb{Z}_+^2$, the positive two-dimensional integer lattice points.

math.PR↗