scholarly journals Efficient importance sampling for large sums of independent and identically distributed random variables

2021 ◽  
Vol 31 (6) ◽  
Author(s):  
Nadhir Ben Rached ◽  
Abdul-Lateef Haji-Ali ◽  
Gerardo Rubino ◽  
Raúl Tempone

AbstractWe discuss estimating the probability that the sum of nonnegative independent and identically distributed random variables falls below a given threshold, i.e., $$\mathbb {P}(\sum _{i=1}^{N}{X_i} \le \gamma )$$ P ( ∑ i = 1 N X i ≤ γ ) , via importance sampling (IS). We are particularly interested in the rare event regime when N is large and/or $$\gamma $$ γ is small. The exponential twisting is a popular technique for similar problems that, in most cases, compares favorably to other estimators. However, it has some limitations: (i) It assumes the knowledge of the moment-generating function of $$X_i$$ X i and (ii) sampling under the new IS PDF is not straightforward and might be expensive. The aim of this work is to propose an alternative IS PDF that approximately yields, for certain classes of distributions and in the rare event regime, at least the same performance as the exponential twisting technique and, at the same time, does not introduce serious limitations. The first class includes distributions whose probability density functions (PDFs) are asymptotically equivalent, as $$x \rightarrow 0$$ x → 0 , to $$bx^{p}$$ b x p , for $$p>-1$$ p > - 1 and $$b>0$$ b > 0 . For this class of distributions, the Gamma IS PDF with appropriately chosen parameters retrieves approximately, in the rare event regime corresponding to small values of $$\gamma $$ γ and/or large values of N, the same performance of the estimator based on the use of the exponential twisting technique. In the second class, we consider the Log-normal setting, whose PDF at zero vanishes faster than any polynomial, and we show numerically that a Gamma IS PDF with optimized parameters clearly outperforms the exponential twisting IS PDF. Numerical experiments validate the efficiency of the proposed estimator in delivering a highly accurate estimate in the regime of large N and/or small $$\gamma $$ γ .

Author(s):  
Afshin Yaghoubi

In statistics and probability theory, one of the most important statistics is the sums of random variables. After introducing a probability distribution, determining the sum of n independent and identically distributed random variables is one of the interesting topics for authors. This paper presents the probability density functions for the sum of n independent and identically distributed random variables such as Shanker, Akash, Ishita, Pranav, Rani, and Ram Awadh. In order to determine all aforementioned distributions, the problem-solving methods are applied which is based on the change-of-variables technique.


Author(s):  
R. J. Eggert ◽  
R. W. Mayne

Abstract Probabilistic optimization using the moment matching method and the simulation optimization method are discussed and compared to conventional deterministic optimization. A new approach based on successively approximating probability density functions, using recursive quadratic programming for the optimization process, is described. This approach incorporates the speed and robustness of analytical probability density functions and improves accuracy by considering simulation results. Theoretical considerations and an example problem illustrate the features of the approach. The paper closes with a discussion of an objective function formulation which includes the expected cost of design constraint failure.


1987 ◽  
Vol 19 (3) ◽  
pp. 632-651 ◽  
Author(s):  
Ushio Sumita ◽  
Yasushi Masuda

We consider a class of functions on [0,∞), denoted by Ω, having Laplace transforms with only negative zeros and poles. Of special interest is the class Ω+ of probability density functions in Ω. Simple and useful conditions are given for necessity and sufficiency of f ∊ Ω to be in Ω+. The class Ω+ contains many classes of great importance such as mixtures of n independent exponential random variables (CMn), sums of n independent exponential random variables (PF∗n), sums of two independent random variables, one in CMr and the other in PF∗1 (CMPFn with n = r + l) and sums of independent random variables in CMn(SCM). Characterization theorems for these classes are given in terms of zeros and poles of Laplace transforms. The prevalence of these classes in applied probability models of practical importance is demonstrated. In particular, sufficient conditions are given for complete monotonicity and unimodality of modified renewal densities.


2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Jing Chen

With a new notion of independence of random variables, we establish the nonadditive version of weak law of large numbers (LLN) for the independent and identically distributed (IID) random variables under Choquet expectations induced by 2-alternating capacities. Moreover, we weaken the moment assumptions to the first absolute moment and characterize the approximate distributions of random variables as well. Naturally, our theorem can be viewed as an extension of the classical LLN to the case where the probability is no longer additive.


Author(s):  
M. D. Edge

This chapter considers the rules of probability. Probabilities are non-negative, they sum to one, and the probability that either of two mutually exclusive events occurs is the sum of the probability of the two events. Two events are said to be independent if the probability that they both occur is the product of the probabilities that each event occurs. Bayes’ theorem is used to update probabilities on the basis of new information, and it is shown that the conditional probabilities P(A|B) and P(B|A) are not the same. Finally, the chapter discusses ways in which distributions of random variables can be described, using probability mass functions for discrete random variables and probability density functions for continuous random variables.


Kybernetes ◽  
2008 ◽  
Vol 37 (9/10) ◽  
pp. 1279-1286 ◽  
Author(s):  
Fan Aihua ◽  
Wang Zhongzhi ◽  
Ding Fangqing

PurposeThe purpose of this paper is to give some limit theorems on ε‐neighborhood and ε‐increasing runs of continuous‐valued dependent random sequence. In the main result no assumptions are made concerning the random variables. As corollary a result on independent case is obtained.Design/methodology/approachThe crucial part of the proof is to construct a non‐negative supper‐martingale depending on a parameter by using the moment generating function, and then applying the Doob's martingale convergence theorem.FindingsThe upper and lower bounds of the deviations from the sums of arbitrary continuous‐valued random variables from the reference distributions are obtained.Research limitations/implicationsThe computation of asymptotic log‐likelihood ratio h(P|Q) is the main limitations, and it is difficult to obtain the rigorous bounds of the deviations.Practical implicationsA useful method to study the property for runs of dependent random sequence.Originality/valueThe new approach of study strong limit behavior for dependent random sequence.


1989 ◽  
Vol 5 (2) ◽  
pp. 241-255 ◽  
Author(s):  
Pierre Perron

We tabulate the limiting cumulative distribution and probability density functions of the least-squares estimator in a first-order autoregressive regression when the true model is near-integrated in the sense of Phillips. The results are obtained using an exact numerical method which integrates the appropriate limiting moment generating function. The adequacy of the approximation is examined for various first-order autoregressive processes with a root close to unity.


2021 ◽  
Vol 1 (1) ◽  
Author(s):  
Ryszard SNOPKOWSKI ◽  
Marta SUKIENNIK ◽  
Aneta NAPIERAJ

The article presents selected issues in the field of stochastic simulation of production process-es. Attention was drawn to the possibilityof including, in this type of models, the risk accompanying the implementation of processes. Probability density functions that can beused to characterize random variables present in the model are presented. The possibility of making mistakes while creat-ing this typeof models was pointed out. Two selected examples of the use of stochastic simulation in the analysis of production processes on theexample of the mining process are presented.


Sign in / Sign up

Export Citation Format

Share Document