scholarly journals Domains of attraction for positive and discrete tempered stable distributions

2018 ◽  
Vol 55 (1) ◽  
pp. 30-42 ◽  
Author(s):  
Michael Grabchak

Abstract We introduce a large and flexible class of discrete tempered stable distributions, and analyze the domains of attraction for both this class and the related class of positive tempered stable distributions. Our results suggest that these are natural models for sums of independent and identically distributed random variables with tempered heavy tails, i.e. tails that appear to be heavy up to a point, but ultimately decay faster.

2013 ◽  
Vol 50 (3) ◽  
pp. 871-882
Author(s):  
Shaul K. Bar-Lev ◽  
Ernst Schulte-Geers ◽  
Wolfgang Stadje

In this paper we derive limit theorems for the conditional distribution ofX1givenSn=snasn→ ∞, where theXiare independent and identically distributed (i.i.d.) random variables,Sn=X1+··· +Xn, andsn/nconverges orsn≡sis constant. We obtain convergence in total variation of PX1∣Sn/n=sto a distribution associated to that ofX1and of PnX1∣Sn=sto a gamma distribution. The case of stable distributions (to which the method of associated distributions cannot be applied) is studied in detail.


2019 ◽  
Vol 34 (1) ◽  
pp. 53-57
Author(s):  
Mohammad Ahsanullah ◽  
V. B. Nevzorov

Abstract If the distribution of the linear combination of two independent and identically distributed random variables from a distribution belongs to the same distribution, then we call that distribution a stable distribution. The Levy distribution is a member of the family of stable distributions. In this paper, we will present some basic distributional properties and characterizations of the Levy distribution.


2013 ◽  
Vol 50 (03) ◽  
pp. 871-882
Author(s):  
Shaul K. Bar-Lev ◽  
Ernst Schulte-Geers ◽  
Wolfgang Stadje

In this paper we derive limit theorems for the conditional distribution of X 1 given S n =s n as n→ ∞, where the X i are independent and identically distributed (i.i.d.) random variables, S n =X 1+··· +X n , and s n /n converges or s n ≡ s is constant. We obtain convergence in total variation of P X 1∣ S n /n=s to a distribution associated to that of X 1 and of P nX 1∣ S n =s to a gamma distribution. The case of stable distributions (to which the method of associated distributions cannot be applied) is studied in detail.


Metrika ◽  
2021 ◽  
Author(s):  
Krzysztof Jasiński

AbstractIn this paper, we study the number of failed components of a coherent system. We consider the case when the component lifetimes are discrete random variables that may be dependent and non-identically distributed. Firstly, we compute the probability that there are exactly i, $$i=0,\ldots ,n-k,$$ i = 0 , … , n - k , failures in a k-out-of-n system under the condition that it is operating at time t. Next, we extend this result to other coherent systems. In addition, we show that, in the most popular model of independent and identically distributed component lifetimes, the obtained probability corresponds to the respective one derived in the continuous case and existing in the literature.


Author(s):  
José Correa ◽  
Paul Dütting ◽  
Felix Fischer ◽  
Kevin Schewior

A central object of study in optimal stopping theory is the single-choice prophet inequality for independent and identically distributed random variables: given a sequence of random variables [Formula: see text] drawn independently from the same distribution, the goal is to choose a stopping time τ such that for the maximum value of α and for all distributions, [Formula: see text]. What makes this problem challenging is that the decision whether [Formula: see text] may only depend on the values of the random variables [Formula: see text] and on the distribution F. For a long time, the best known bound for the problem had been [Formula: see text], but recently a tight bound of [Formula: see text] was obtained. The case where F is unknown, such that the decision whether [Formula: see text] may depend only on the values of the random variables [Formula: see text], is equally well motivated but has received much less attention. A straightforward guarantee for this case of [Formula: see text] can be derived from the well-known optimal solution to the secretary problem, where an arbitrary set of values arrive in random order and the goal is to maximize the probability of selecting the largest value. We show that this bound is in fact tight. We then investigate the case where the stopping time may additionally depend on a limited number of samples from F, and we show that, even with o(n) samples, [Formula: see text]. On the other hand, n samples allow for a significant improvement, whereas [Formula: see text] samples are equivalent to knowledge of the distribution: specifically, with n samples, [Formula: see text] and [Formula: see text], and with [Formula: see text] samples, [Formula: see text] for any [Formula: see text].


Author(s):  
R. A. Maller

AbstractThe main purpose of the paper is to give necessary and sufficient conditions for the almost sure boundedness of (Sn – αn)/B(n), where Sn = X1 + X2 + … + XmXi being independent and identically distributed random variables, and αnand B(n) being centering and norming constants. The conditions take the form of the convergence or divergence of a series of a geometric subsequence of the sequence P(Sn − αn > a B(n)), where a is a constant. The theorem is distinguished from previous similar results by the comparative weakness of the subsidiary conditions and the simplicity of the calculations. As an application, a law of the iterated logarithm general enough to include a result of Feller is derived.


1977 ◽  
Vol 14 (1) ◽  
pp. 75-88 ◽  
Author(s):  
Lajos Takács

In 1952 Pollaczek discovered a remarkable formula for the Laplace-Stieltjes transforms of the distributions of the ordered partial sums for a sequence of independent and identically distributed real random variables. In this paper Pollaczek's result is proved in a simple way and is extended for a semi-Markov sequence of real random variables.


Sign in / Sign up

Export Citation Format

Share Document