Metropolis has embraced its namesake connection to Superman’s fictional city with such enthusiasm that you might find yourself checking the sky for flying men in capes. The town sits quietly along the ...

Based on the classical lattice model (Heisenberg, XY, XYZ, etc.), code Ether has been developed to study the thermodynamics of ANY CRYSTAL SYSTEM by performing the basic Monte Carlo methods.

For SU(2) lattice gauge theory with the fundamental-adjoint action an efficient heat-bath algorithm is not known so that one had to rely on Metropolis simulations supplemented by overrelaxation.

This guide will help you get the most out of YouTube, understand the platform's algorithm and gain visibility for your best videos. YouTube has the second-highest number of active users making it the ...

Hamiltonian Monte Carlo (HMC) is a state-of-the-art method for sampling from unnormalized, high-dimensional target distributions, and is the cornerstone for most probabilistic programming routines. By ...

Abstract: While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes. Hence data ...

We discuss the rejection-free event-chain Monte-Carlo algorithm and several applications to dense soft matter systems. Event-chain Monte-Carlo is an alternative to standard local Markov-chain ...

A highly modular simulation framework of Monte-Carlo methods, based on the Ising Model in a 2D spin lattice. Producing results for the macroscopic properties of the system via simulation and ...

Many computational problems in modern-day statistics are heavily dependent on Markov chain Monte Carlo (MCMC) methods. These algorithms allow us to evaluate arbitrary probability distributions; ...

ABSTRACT: We investigate global temperature data produced by the Climate Research Unit at the University of East Anglia (CRU) and the Berkeley Earth Surface Temperature consortium (BEST). We first fit ...

Abstract: In this paper we study the suitability of the Metropolis Algorithm and its generalization for solving the shortest lattice vector problem (SVP). SVP has numerous applications spanning from ...

This work presents a version of the Metropolis–Hastings algorithm using quasi-Monte Carlo inputs. We prove that the method yields consistent estimates in some problems with finite state spaces and ...