An original sensitivity statistic within a new adaptive accelerated Monte-Carlo method
نویسندگان
چکیده
منابع مشابه
Adaptive Monte Carlo Approach for Sensitivity Analysis
An adaptive Monte Carlo strategy for computing global Sobol ́ sensitivity indices has been presented and discussed. The experimental scheme including an approximation tool, variance-based approaches for sensitivity analysis and Monte Carlo technique for multidimensional integration has been described and studied.
متن کاملMonte Carlo conditioning on a sufficient statistic
In this paper we derive general formulae suitable for Monte Carlo computation of conditional expectations of functions of a random vector given a sufficient statistic. The problem of direct sampling from the conditional distribution is considered in particular. It is shown that this can be done by a simple parameter adjustment of the original statistical model, provided the model has a certain ...
متن کاملA surrogate accelerated multicanonical Monte Carlo method for uncertainty quantification
In this work we consider a class of uncertainty quantification problems where the system performance or reliability is characterized by a scalar parameter y. The performance parameter y is random due to the presence of various sources of uncertainty in the system, and our goal is to estimate the probability density function (PDF) of y. We propose to use the multicanonical Monte Carlo (MMC) meth...
متن کاملAdaptive kinetic Monte Carlo for first-principles accelerated dynamics.
The adaptive kinetic Monte Carlo method uses minimum-mode following saddle point searches and harmonic transition state theory to model rare-event, state-to-state dynamics in chemical and material systems. The dynamical events can be complex, involve many atoms, and are not constrained to a grid-relaxing many of the limitations of regular kinetic Monte Carlo. By focusing on low energy processes...
متن کاملAn Adaptive Markov Chain Monte Carlo Method for GARCH Model
We propose a method to construct a proposal density for the Metropolis-Hastings algorithm in Markov Chain Monte Carlo (MCMC) simulations of the GARCH model. The proposal density is constructed adaptively by using the data sampled by the MCMC method itself. It turns out that autocorrelations between the data generated with our adaptive proposal density are greatly reduced. Thus it is concluded t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia - Social and Behavioral Sciences
سال: 2010
ISSN: 1877-0428
DOI: 10.1016/j.sbspro.2010.05.192