scholarly journals An asymmetric St. Petersburg game with trimming

2018 ◽  
Vol 50 (A) ◽  
pp. 115-129
Author(s):  
Allan Gut ◽  
Anders Martin-Löf
Keyword(s):  
Limit Theorems ◽  
Random Number ◽  
Almost Sure Convergence ◽  
Fixed Number ◽  
Convergence In Distribution ◽  
Trimmed Sums ◽  
Distribution Theorem ◽  
Total Maximum

Abstract 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.

Convergence in distribution of lightly trimmed and untrimmed sums are equivalent

1993 ◽  
Vol 113 (3) ◽  
pp. 615-638 ◽  
Author(s):  
Harry Kesten
Keyword(s):  
Limit Distribution ◽  
Random Variables ◽  
Fixed Number ◽  
Convergence In Distribution ◽  
Trimmed Sums ◽  
Limiting Behaviour ◽  
Modest Effect

AbstractWe show that trimming a fixed number of terms from sums of i.i.d. random variables (so-called light trimming) can have only a modest effect on limiting behaviour. More specifically, the trimmed sums, after centralization and normalization, have a limit distribution, if and only if the untrimmed sums have a limit distribution (with the same centralization and normalization constants).

scholarly journals Asymptotic behaviors with convergence rates of distributions of negative-binomial sums

2020 ◽  
Vol 22 (4) ◽  
pp. 415-421
Author(s):  
Tran Loc Hung ◽  
Phan Tri Kien ◽  
Nguyen Tan Nhut
Keyword(s):  
Limit Theorems ◽  
Negative Binomial ◽  
Convergence Rates ◽  
Random Variables ◽  
Rates Of Convergence ◽  
Weak Limit ◽  
Probability Metric ◽  
Weak Limit Theorems ◽  
Distribution Theorem ◽  
Binomial Sums

The negative-binomial sum is an extension of a geometric sum. It has been arisen from the necessity to resolve practical problems in telecommunications, network analysis, stochastic finance and insurance mathematics, etc. Up to the present, the topics related to negative-binomial sums like asymptotic distributions and rates of convergence have been investigated by many mathematicians. However, in a lot of various situations, the results concerned the rates of convergence for negative-binomial sums are still restrictive. The main purpose of this paper is to establish some weak limit theorems for negative-binomial sums of independent, identically distributed (i.i.d.) random variables via Gnedenko's Transfer Theorem originated by Gnedenko and Fahim (1969). Using Zolotarev's probability metric, the rate of convergence in weak limit theorems for negativebinomial sum are established. The received results are the rates of convergence in weak limit theorem for partial sum of i.i.d random variables related to symmetric stable distribution (Theorem 1), and asymptotic distribution together with the convergence rates for negative-binomial sums of i.i.d. random variables concerning to symmetric Linnik laws and Generalized Linnik distribution (Theorem 2 and Theorem 3). Based on the results of this paper, the analogous results for geometric sums of i.i.d. random variables will be concluded as direct consequences. However, the article has just been solved for the case of 1 <a < 2; it is quite hard to estimate in the case of a 2 (0;1) via the Zolotarev's probability metric. Mathematics Subject Classification 2010: 60G50; 60F05; 60E07.

Limit theorems for the minimal position in a branching random walk with independent logconcave displacements

2000 ◽  
Vol 32 (01) ◽  
pp. 159-176 ◽  
Author(s):  
Markus Bachmann
Keyword(s):  
Random Walk ◽  
Limit Theorems ◽  
Random Number ◽  
Time Lag ◽  
Extreme Value Distribution ◽  
Extreme Value ◽  
Limiting Distribution ◽  
Branching Random Walk ◽  
Minimal Position ◽  
Conditional Limit

Consider a branching random walk in which each particle has a random number (one or more) of offspring particles that are displaced independently of each other according to a logconcave density. Under mild additional assumptions, we obtain the following results: the minimal position in the nth generation, adjusted by its α-quantile, converges weakly to a non-degenerate limiting distribution. There also exists a ‘conditional limit’ of the adjusted minimal position, which has a (Gumbel) extreme value distribution delayed by a random time-lag. Consequently, the unconditional limiting distribution is a mixture of extreme value distributions.

scholarly journals Almost Sure Limit Theorems for Multivariate General Standard Normal Sequences and Applications

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Zhicheng Chen ◽  
Xinsheng Liu
Keyword(s):  
Central Limit ◽  
Limit Theorems ◽  
Almost Sure Convergence ◽  
Central Limit Theorems ◽  
Random Vectors ◽  
Standard Normal ◽  
Almost Sure Limit Theorems ◽  
General Standard

Under suitable conditions, the almost sure central limit theorems for the maximum of general standard normal sequences of random vectors are proved. The simulation of the almost sure convergence for the maximum is firstly performed, which helps to visually understand the theorems by applying to two new examples.

scholarly journals Limit Theorems for a Generalized ST Petersburg Game

2010 ◽  
Vol 47 (3) ◽  
pp. 752-760 ◽  
Author(s):  
Allan Gut
Keyword(s):  
Limit Theorems ◽  
Convergence In Distribution ◽  
Stable Law ◽  
Geometric Size

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)/α) = pqk-1, k = 1, 2,…, where p + q = 1, s = 1 / p, r = 1 / q, and 0 < α ≤ 1. For the case in which α = 1, we extend Feller's classical weak law and Martin-Löf's theorem on convergence in distribution along the 2n-subsequence. The analog for 0 < α < 1 turns out to converge in distribution to an asymmetric stable law with index α. Finally, some limit theorems for polynomial and geometric size total gains, as well as for extremes, are given.

COMPLETE CONVERGENCE FOR ARRAYS AND THE LAW OF THE SINGLE LOGARITHM

2017 ◽  
Vol 96 (2) ◽  
pp. 333-344
Author(s):  
ALLAN GUT ◽  
ULRICH STADTMÜLLER
Keyword(s):  
Limit Theorems ◽  
Complete Convergence ◽  
Law Of Large Numbers ◽  
Almost Sure Convergence ◽  
Strong Law ◽  
Moment Conditions ◽  
Large Numbers ◽  
Distributed Arrays ◽  
The Law ◽  
Independent And Identically Distributed

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.

Limit theorems for thinning of renewal point processes

1972 ◽  
Vol 9 (4) ◽  
pp. 847-851 ◽  
Author(s):  
Råde L.
Keyword(s):  
Poisson Process ◽  
Limit Theorems ◽  
Point Processes ◽  
Random Number

Limit theorems for the thinning of renewal point processes according to two different schemes are studied. In the first scheme when a point is retained a random number of succeeding points are deleted. According to the second scheme a random number of points are deleted by an inhibitory Poisson process.

Sign in / Sign up

Export Citation Format

Share Document