اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTargetting Kollo Skewness with Random Orthogonal Matrix Simulation
57
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Modelling multivariate systems is important for many applications in engineering and operational research. The multivariate distributions under scrutiny usually have no analytic or closed form. Therefore their modelling employs a numerical technique, typically multivariate simulations, which can have very high dimensions. Random Orthogonal Matrix (ROM) simulation is a method that has gained some popularity because of the absence of certain simulation errors. Specifically, it exactly matches a target mean, covariance matrix and certain higher moments with every simulation. This paper extends the ROM simulation algorithm presented by Hanke et al. (2017), hereafter referred to as HPSW, which matches the target mean, covariance matrix and Kollo skewness vector exactly. Our first contribution is to establish necessary and sufficient conditions for the HPSW algorithm to work. Our second contribution is to develop a general approach for constructing admissible values in the HPSW. Our third theoretical contribution is to analyse the effect of multivariate sample concatenation on the target Kollo skewness. Finally, we illustrate the extensions we develop here using a simulation study.
قيم البحث
اقرأ أيضاً
We gather several results on the eigenvalues of the spatial sign covariance matrix of an elliptical distribution. It is shown that the eigenvalues are a one-to-one function of the eigenvalues of the shape matrix and that they are closer together than
the latter. We further provide a one-dimensional integral representation of the eigenvalues, which facilitates their numerical computation.
In this paper, we analyze the convergence rate of a collapsed Gibbs sampler for crossed random effects models. Our results apply to a substantially larger range of models than previous works, including models that incorporate missingness mechanism an
d unbalanced level data. The theoretical tools involved in our analysis include a connection between relaxation time and autoregression matrix, concentration inequalities, and random matrix theory.
We propose a new unbiased estimator for estimating the utility of the optimal stopping problem. The MUSE, short for `Multilevel Unbiased Stopping Estimator, constructs the unbiased Multilevel Monte Carlo (MLMC) estimator at every stage of the optimal
stopping problem in a backward recursive way. In contrast to traditional sequential methods, the MUSE can be implemented in parallel when multiple processors are available. We prove the MUSE has finite variance, finite computational complexity, and achieves $varepsilon$-accuracy with $O(1/varepsilon^2)$ computational cost under mild conditions. We demonstrate MUSE empirically in several numerical examples, including an option pricing problem with high-dimensional inputs, which illustrates the use of the MUSE on computer clusters.
The global sensitivity analysis of a complex numerical model often calls for the estimation of variance-based importance measures, named Sobol indices. Metamodel-based techniques have been developed in order to replace the cpu time-expensive computer
code with an inexpensive mathematical function, which predicts the computer code output. The common metamodel-based sensitivity analysis methods are well-suited for computer codes with scalar outputs. However, in the environmental domain, as in many areas of application, the numerical model outputs are often spatial maps, which may also vary with time. In this paper, we introduce an innovative method to obtain a spatial map of Sobol indices with a minimal number of numerical model computations. It is based upon the functional decomposition of the spatial output onto a wavelet basis and the metamodeling of the wavelet coefficients by the Gaussian process. An analytical example is presented to clarify the various steps of our methodology. This technique is then applied to a real hydrogeological case: for each model input variable, a spatial map of Sobol indices is thus obtained.
In Scott (2002) and Congdon (2006), a new method is advanced to compute posterior probabilities of models under consideration. It is based solely on MCMC outputs restricted to single models, i.e., it is bypassing reversible jump and other model explo
ration techniques. While it is indeed possible to approximate posterior probabilities based solely on MCMC outputs from single models, as demonstrated by Gelfand and Dey (1994) and Bartolucci et al. (2006), we show that the proposals of Scott (2002) and Congdon (2006) are biased and advance several arguments towards this thesis, the primary one being the confusion between model-based posteriors and joint pseudo-posteriors. From a practical point of view, the bias in Scotts (2002) approximation appears to be much more severe than the one in Congdons (2006), the later being often of the same magnitude as the posterior probability it approximates, although we also exhibit an example where the divergence from the true posterior probability is extreme.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
