The asymptotic distribution of the maximum deficit of partial sums of independent random variables

1979 ◽  
Vol 15 (2) ◽  
pp. 495-497 ◽  
Author(s):  
Francisco L. S. Gomide
1950 ◽  
Vol 2 ◽  
pp. 375-384 ◽  
Author(s):  
Mark Kac ◽  
Harry Pollard

1. The problem. It has been shown [1] that if Xi, + X2, … are independent random variables each of density then(1.1)


2012 ◽  
Vol 49 (3) ◽  
pp. 883-887 ◽  
Author(s):  
Offer Kella

The goal is to identify the class of distributions to which the distribution of the maximum of a Lévy process with no negative jumps and negative mean (equivalently, the stationary distribution of the reflected process) belongs. An explicit new distributional identity is obtained for the case where the Lévy process is an independent sum of a Brownian motion and a general subordinator (nondecreasing Lévy process) in terms of a geometrically distributed sum of independent random variables. This generalizes both the distributional form of the standard Pollaczek-Khinchine formula for the stationary workload distribution in the M/G/1 queue and the exponential stationary distribution of a reflected Brownian motion.


1975 ◽  
Vol 12 (02) ◽  
pp. 279-288 ◽  
Author(s):  
N. Veraverbeke ◽  
J. L. Teugels

Let Gn (x) be the distribution function of the maximum of the successive partial sums of independent and identically distributed random variables and G(x) its limiting distribution function. Under conditions, typical for complete exponential convergence, the decay of Gn (x) — G(x) is asymptotically equal to c.H(x)n −3/2 γn as n → ∞ where c and γ are known constants and H(x) is a function solely depending on x.


1994 ◽  
Vol 17 (2) ◽  
pp. 323-340 ◽  
Author(s):  
Deli Li ◽  
M. Bhaskara Rao ◽  
Xiangchen Wang

Combining Feller's criterion with a non-uniform estimate result in the context of the Central Limit Theorem for partial sums of independent random variables, we obtain several results on the Law of the Iterated Logarithm. Two of these results refine corresponding results of Wittmann (1985) and Egorov (1971). In addition, these results are compared with the corresponding results of Teicher (1974), Tomkins (1983) and Tomkins (1990)


2002 ◽  
Vol 32 (1) ◽  
pp. 43-55 ◽  
Author(s):  
K.W. Ng ◽  
Q.H. Tang ◽  
H. Yang

AbstractIn this paper, we investigate asymptotic properties of the tail probabilities of the maxima of partial sums of independent random variables. For some large classes of heavy-tailed distributions, we show that the tail probabilities of the maxima of the partial sums asymptotically equal to the sum of the tail probabilities of the individual random variables. Then we partially extend the result to the case of random sums. Applications to some commonly used risk processes are proposed. All heavy-tailed distributions involved in this paper are supposed on the whole real line.


1999 ◽  
Vol 36 (01) ◽  
pp. 194-210 ◽  
Author(s):  
Sungyeol Kang ◽  
Richard F. Serfozo

A basic issue in extreme value theory is the characterization of the asymptotic distribution of the maximum of a number of random variables as the number tends to infinity. We address this issue in several settings. For independent identically distributed random variables where the distribution is a mixture, we show that the convergence of their maxima is determined by one of the distributions in the mixture that has a dominant tail. We use this result to characterize the asymptotic distribution of maxima associated with mixtures of convolutions of Erlang distributions and of normal distributions. Normalizing constants and bounds on the rates of convergence are also established. The next result is that the distribution of the maxima of independent random variables with phase type distributions converges to the Gumbel extreme-value distribution. These results are applied to describe completion times for jobs consisting of the parallel-processing of tasks represented by Markovian PERT networks or task-graphs. In these contexts, which arise in manufacturing and computer systems, the job completion time is the maximum of the task times and the number of tasks is fairly large. We also consider maxima of dependent random variables for which distributions are selected by an ergodic random environment process that may depend on the variables. We show under certain conditions that their distributions may converge to one of the three classical extreme-value distributions. This applies to parallel-processing where the subtasks are selected by a Markov chain.


2012 ◽  
Vol 195-196 ◽  
pp. 694-700
Author(s):  
Hai Wu Huang ◽  
Qun Ying Wu ◽  
Guang Ming Deng

The main purpose of this paper is to investigate some properties of partial sums for negatively dependent random variables. By using some special numerical functions, and we get some probability inequalities and exponential inequalities of partial sums, which generalize the corresponding results for independent random variables and associated random variables. At last, exponential inequalities and Bernsteins inequality for negatively dependent random variables are presented.


Sign in / Sign up

Export Citation Format

Share Document