Related papers: Monte Carlo results for three-dimensional self-avo…
Population Monte Carlo (PMC) sampling methods are powerful tools for approximating distributions of static unknowns given a set of observations. These methods are iterative in nature: at each step they generate samples from a proposal…
Monte Carlo methods approximate integrals by sample averages of integrand values. The error of Monte Carlo methods may be expressed as a trio identity: the product of the variation of the integrand, the discrepancy of the sampling measure,…
We carry out a high-precision simulation of the two-dimensional $SU(3)$ principal chiral model at correlation lengths $\xi$ up to $\sim 4 \times 10^5$, using a multi-grid Monte Carlo (MGMC) algorithm and approximately one year of Cray C-90…
Article describes the results of the development and using of Rare-Event Monte-Carlo Simulation Algorithms for Dynamic Fault Trees Estimation. For Fault Trees estimation usually analytical methods are used (Minimal Cut sets, Markov Chains,…
We compute by Monte Carlo numerical simulations the critical exponents of two-dimensional scalar field theories at the $\lambda\phi^6$ tricritical point. The results are in agreement with the Zamolodchikov conjecture based on conformal…
We study the 3d Ising universality class using the functional renormalisation group. With the help of background fields and a derivative expansion up to fourth order we compute the leading index, the subleading symmetric and anti-symmetric…
We explain in detail how to estimate mean values and assess statistical errors for arbitrary functions of elementary observables in Monte Carlo simulations. The method is to estimate and sum the relevant autocorrelation functions, which is…
We introduce a variant of the multi-grid Monte Carlo (MGMC) method, based on the embedding of an $XY$ model into the target model, and we study its mathematical properties for a variety of nonlinear $\sigma$-models. We then apply the method…
Monte Carlo planners can often return sub-optimal actions, even if they are guaranteed to converge in the limit of infinite samples. Known asymptotic regret bounds do not provide any way to measure confidence of a recommended action at the…
There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase transition for self-avoiding walk on the…
We propose a Monte Carlo method to efficiently find, count, and sample abstract triangulations of a given manifold M. The method is based on a biased random walk through all possible triangulations of M (in the Pachner graph), constructed…
We introduce a novel random walk model that emerges in the event-chain Monte Carlo (ECMC) of spin systems. In the ECMC, the lifting variable specifying the spin to be updated changes its value to one of its interacting neighbor spins. This…
The scaling properties of self-avoiding walks on a d-dimensional diluted lattice at the percolation threshold are analyzed by a field-theoretical renormalization group approach. To this end we reconsider the model of Y. Meir and A. B.…
The Diffusion Monte Carlo method is devoted to the computation of electronic ground-state energies of molecules. In this paper, we focus on implementations of this method which consist in exploring the configuration space with a {\bf fixed}…
An irreversible Markov-chain Monte Carlo (MCMC) algorithm with skew detailed balance conditions originally proposed by Turitsyn et al. is extended to general discrete systems on the basis of the Metropolis-Hastings scheme. To evaluate the…
We present a Monte Carlo study of the two-component $\phi^4$ model on the simple cubic lattice in three dimensions. By suitable tuning of the coupling constant $\lambda$ we eliminate leading order corrections to scaling. High statistics…
In this paper the multi-dimensional random walk models governed by distributed fractional order differential equations and multi-term fractional order differential equations are constructed. The scaling limits of these random walks to a…
We describe a new method to compute renormalized coupling constants in a Monte Carlo renormalization group calculation. The method can be used for a general class of models, e.g., lattice spin or gauge models. The basic idea is to simulate…
It is shown how to obtain accurate values for American options using Monte Carlo simulation. The main feature of the novel algorithm consists of tracking the boundary between exercise and hold regions via optimization of a certain payoff…
Quantum Monte Carlo method is used to look into the superconductivity in the three-leg Hubbard ladder. The enhanced correlation for the pairing across the central and edge chains, which has been predicted in the weak-coupling…