Related papers: Monte Carlo errors with less errors
Monte Carlo simulations are widely employed to measure the physical properties of glass-forming liquids in thermal equilibrium. Combined with local Monte Carlo moves, the Metropolis algorithm can also be used to simulate the relaxation…
In this paper, we aim to compute numerical approximation integral by using an adaptive Monte Carlo algorithm. We propose a stratified sampling algorithm based on an iterative method which splits the strata following some quantities called…
We introduce and analyze a parallel sequential Monte Carlo methodology for the numerical solution of optimization problems that involve the minimization of a cost function that consists of the sum of many individual components. The proposed…
We present a new method for conducting Monte Carlo inference in graphical models which combines explicit search with generalized importance sampling. The idea is to reduce the variance of importance sampling by searching for significant…
Sequential Monte Carlo (SMC) methods are a class of techniques to sample approximately from any sequence of probability distributions using a combination of importance sampling and resampling steps. This paper is concerned with the…
The theme of the present paper is numerical integration of $C^r$ functions using randomized methods. We consider variance reduction methods that consist in two steps. First the initial interval is partitioned into subintervals and the…
The calculation of imaginary time displaced correlation functions with the auxiliary field projector quantum Monte-Carlo algorithm provides valuable insight (such as spin and charge gaps) in the model under consideration. One of the authors…
In this note we study the numerical stability problem that may take place when calculating the cumulative distribution function of the {\it Hypoexponential} random variable. This computation is extensively used during the execution of Monte…
This paper is on Bayesian inference for parametric statistical models that are defined by a stochastic simulator which specifies how data is generated. Exact sampling is then possible but evaluating the likelihood function is typically…
In this paper, we examine the Sample Average Approximation (SAA) procedure within a framework where the Monte Carlo estimator of the expectation is biased. We also introduce Multilevel Monte Carlo (MLMC) in the SAA setup to enhance the…
Conventional Monte Carlo simulations are stochastic in the sense that the acceptance of a trial move is decided by comparing a computed acceptance probability with a random number, uniformly distributed between 0 and 1. Here we consider the…
A method is proposed to handle the sign problem in the simulation of systems having indefinite or complex-valued measures. In general, this new approach, which is based on renormalisation blocking, is shown to yield statistical errors…
Estimating Monte Carlo error is critical to valid simulation results in Markov chain Monte Carlo (MCMC) and initial sequence estimators were one of the first methods introduced for this. Over the last few years, focus has been on…
We discuss the analytic computation of autocorrelation functions for the generalized Hybrid Monte Carlo algorithm applied to free field theory and compare the results with numerical results for the $O(4)$ spin model in two dimensions. We…
The diagram technique allows one to calculate the correction factors which can be used in Monte Carlo simulation of some processes. This is equivalent to the calculation with accounting for all or some part of the interference…
We propose and analyze a method for computing failure probabilities of systems modeled as numerical deterministic models (e.g., PDEs) with uncertain input data. A failure occurs when a functional of the solution to the model is below (or…
Boson sampling is a promising candidate for quantum supremacy. It requires to sample from a complicated distribution, and is trusted to be intractable on classical computers. Among the various classical sampling methods, the Markov chain…
Monte Carlo methods use random sampling to estimate numerical quantities which are hard to compute deterministically. One important example is the use in statistical physics of rapidly mixing Markov chains to approximately compute partition…
The importance-sampling Monte Carlo algorithm appears to be the universally optimal solution to the problem of sampling the state space of statistical mechanical systems according to the relative importance of configurations for the…
Monte Carlo is a simple and flexible tool that is widely used in computational finance. In this context, it is common for the quantity of interest to be the expected value of a random variable defined via a stochastic differential equation.…