Allan Gut
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Allan Gut has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Ulrich Stadtmüller
Ulm University
16 shared publications - Anders Martin-Löf
Stockholm University
4 shared publications - Josef G. Steinebach
Universität zu Köln
4 shared publications Josef Steinebach
Philipps‐Universität, Marburg
1 shared publication- Nitis Mukhopadhyay
Department of Statistics, University of Connecticut, Storrs, USA
1 shared publication - Svante Janson
Department of Mathematics, Uppsala University, Uppsala, Sweden
1 shared publication
Latest Publications
- 16 September 2021
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 58 (3) , 805-829
Variations of the elephant random walk
In the classical simple random walk the steps are independent, that is, the walker has no memory. In contrast, in the elephant random walk, which was introduced by Schütz and Trimper [19] in 2004, 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.
- 16 September 2021
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 58 (3) , 805-829
Variations of the elephant random walk
In the classical simple random walk the steps are independent, that is, the walker has no memory. In contrast, in the elephant random walk, which was introduced by Schütz and Trimper [19] in 2004, 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.
- 8 April 2021
- Published by Elsevier in Statistics & Probability Letters
- Vol. 174, 109112
The number of zeros in Elephant random walks with delays
- 8 April 2021
- Published by Elsevier in Statistics & Probability Letters
- Vol. 174, 109112
The number of zeros in Elephant random walks with delays
- Open Access
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\"utz 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.
Open AccessThe 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\"utz 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.
- Open Access
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\"utz 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).
Open AccessElephant 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\"utz 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).
- Open Access
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\"utz 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.
Open AccessVariations 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\"utz 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.
- 1 December 2018
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 50 (A) , 115-129
An asymmetric St. Petersburg game with trimming
Let Sn,n≥1, be the successive sums of the payoffs in the classical St. Petersburg game. The celebrated Feller weak law states that Sn∕(nlog2n)→ℙ1 as n→∞. In this paper we review some earlier results of ours and extend some of them as we consider an asymmetric St. Petersburg game, in which the distribution of the payoff X is given by ℙ(X=srk-1)=pqk-1,k=1,2,…, where p+q=1 and s,r>0. Two main results are extensions of the Feller weak law and the convergence in distribution theorem of Martin-Löf (1985). Moreover, it is well known that almost-sure convergence fails, though Csörgő and Simons (1996) showed that almost-sure convergence holds for trimmed sums and also for sums trimmed by an arbitrary fixed number of maxima. In view of the discreteness of the distribution we focus on `max-trimmed sums', that is, on the sums trimmed by the random number of observations that are equal to the largest one, and prove limit theorems for simply trimmed sums, for max-trimmed sums, as well as for the `total maximum'. Analogues with respect to the random number of summands equal to the minimum are also obtained and, finally, for joint trimming.
- 1 December 2018
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 50 (A) , 115-129
An asymmetric St. Petersburg game with trimming
Let Sn,n≥1, be the successive sums of the payoffs in the classical St. Petersburg game. The celebrated Feller weak law states that Sn∕(nlog2n)→ℙ1 as n→∞. In this paper we review some earlier results of ours and extend some of them as we consider an asymmetric St. Petersburg game, in which the distribution of the payoff X is given by ℙ(X=srk-1)=pqk-1,k=1,2,…, where p+q=1 and s,r>0. Two main results are extensions of the Feller weak law and the convergence in distribution theorem of Martin-Löf (1985). Moreover, it is well known that almost-sure convergence fails, though Csörgő and Simons (1996) showed that almost-sure convergence holds for trimmed sums and also for sums trimmed by an arbitrary fixed number of maxima. In view of the discreteness of the distribution we focus on `max-trimmed sums', that is, on the sums trimmed by the random number of observations that are equal to the largest one, and prove limit theorems for simply trimmed sums, for max-trimmed sums, as well as for the `total maximum'. Analogues with respect to the random number of summands equal to the minimum are also obtained and, finally, for joint trimming.
- 29 August 2017
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 96 (2) , 333-344
COMPLETE CONVERGENCE FOR ARRAYS AND THE LAW OF THE SINGLE LOGARITHM
The present paper is devoted to complete convergence and the strong law of large numbers under moment conditions near those of the law of the single logarithm (LSL) for independent and identically distributed arrays. More precisely, we investigate limit theorems under moment conditions which are stronger than $2p$ for any $p<2$ , in which case we know that there is almost sure convergence to 0, and weaker than $E\,X^{4}/(\log ^{+}|X|)^{2}<\infty$ , in which case the LSL holds.- 29 August 2017
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 96 (2) , 333-344
COMPLETE CONVERGENCE FOR ARRAYS AND THE LAW OF THE SINGLE LOGARITHM
The present paper is devoted to complete convergence and the strong law of large numbers under moment conditions near those of the law of the single logarithm (LSL) for independent and identically distributed arrays. More precisely, we investigate limit theorems under moment conditions which are stronger than $2p$ for any $p<2$ , in which case we know that there is almost sure convergence to 0, and weaker than $E\,X^{4}/(\log ^{+}|X|)^{2}<\infty$ , in which case the LSL holds.- 3 April 2017
- Published by Taylor & Francis in Sequential Analysis
- Vol. 36 (2) , 290-298
A pointwise limit theorem for counting processes of perturbed random walks with an application to repeated significance tests
Hsu and Robbins ( 1947 Hsu, P. L. and Robbins, H. (1947). Complete Convergence and the Law of Large Numbers. Proceedings of National Academy of Sciences USA 33: 25–31. [Crossref], [PubMed], [Web of Science ®] [Google Scholar] ) introduced the concept of complete convergence as a complement to the Kolmogorov strong law in that they proved that provided the mean of the summands is zero and that the variance is finite. Later, Erdős proved the necessity ( 1949 Erdős, P. (1949). On a Theorem of Hsu and Robbins. Annals of Mathematical Statistics 20: 286–291. [Crossref] [Google Scholar] , 1950 Erdős, P. (1950). Remark on My Paper “On a Theorem of Hsu and Robbins”. Annals of Mathematical Statistics 21: 138. [Crossref] [Google Scholar] ). Heyde ( 1975 Heyde, C. C. (1975). A Supplement to the Strong Law of Large Numbers. Journal of Applied Probability 12: 173–175. [Crossref], [Web of Science ®] [Google Scholar] ) proved that, under the same conditions, , thereby opening an area of research that has been called precise asymptotics. Both results above have been extended and generalized in various directions. Kao ( 1978 Kao, Ch.-S. (1978). On the Time and the Excess of Linear Boundary Crossings of Sample Sum. Annals of Statistics 6: 191–199. [Crossref], [Web of Science ®] [Google Scholar] ) proved a pointwise version of Heyde’s result, viz. for the counting process , he showed that , where W(⋅) is the standard Wiener process. In this article, we prove an analog for perturbed random walks and illustrate how they enter naturally within the theory of repeated significance tests in exponential families.
- 3 April 2017
- Published by Taylor & Francis in Sequential Analysis
- Vol. 36 (2) , 290-298
A pointwise limit theorem for counting processes of perturbed random walks with an application to repeated significance tests
Hsu and Robbins ( 1947 Hsu, P. L. and Robbins, H. (1947). Complete Convergence and the Law of Large Numbers. Proceedings of National Academy of Sciences USA 33: 25–31. [Crossref], [PubMed], [Web of Science ®] [Google Scholar] ) introduced the concept of complete convergence as a complement to the Kolmogorov strong law in that they proved that provided the mean of the summands is zero and that the variance is finite. Later, Erdős proved the necessity ( 1949 Erdős, P. (1949). On a Theorem of Hsu and Robbins. Annals of Mathematical Statistics 20: 286–291. [Crossref] [Google Scholar] , 1950 Erdős, P. (1950). Remark on My Paper “On a Theorem of Hsu and Robbins”. Annals of Mathematical Statistics 21: 138. [Crossref] [Google Scholar] ). Heyde ( 1975 Heyde, C. C. (1975). A Supplement to the Strong Law of Large Numbers. Journal of Applied Probability 12: 173–175. [Crossref], [Web of Science ®] [Google Scholar] ) proved that, under the same conditions, , thereby opening an area of research that has been called precise asymptotics. Both results above have been extended and generalized in various directions. Kao ( 1978 Kao, Ch.-S. (1978). On the Time and the Excess of Linear Boundary Crossings of Sample Sum. Annals of Statistics 6: 191–199. [Crossref], [Web of Science ®] [Google Scholar] ) proved a pointwise version of Heyde’s result, viz. for the counting process , he showed that , where W(⋅) is the standard Wiener process. In this article, we prove an analog for perturbed random walks and illustrate how they enter naturally within the theory of repeated significance tests in exponential families.
- 27 December 2016
- Published by Springer Nature in Acta Mathematica Hungarica
- Vol. 151 (2) , 510-530
Almost sure limit behavior of Cesàro sums with small order
- 27 December 2016
- Published by Springer Nature in Acta Mathematica Hungarica
- Vol. 151 (2) , 510-530
Almost sure limit behavior of Cesàro sums with small order
- 3 November 2016
- Published by Elsevier in Statistics & Probability Letters
- Vol. 122, 63-72
Strong laws for sequences in the vicinity of the LIL
- 3 November 2016
- Published by Elsevier in Statistics & Probability Letters
- Vol. 122, 63-72
Strong laws for sequences in the vicinity of the LIL