Related papers: Broad Histogram Monte Carlo
We propose a modified power method for computing the subdominant eigenvalue $\lambda_2$ of a matrix or continuous operator. Here we focus on defining simple Monte Carlo methods for its application. The methods presented use random walkers…
We propose a new recursive procedure to estimate the microcanonical density of states in multicanonical Monte Carlo simulations which relies only on measurements of moments of the energy distribution, avoiding entirely the need for energy…
Computing the volume of a polytope in high dimensions is computationally challenging but has wide applications. Current state-of-the-art algorithms to compute such volumes rely on efficient sampling of a Gaussian distribution restricted to…
The thinning method for numerical generation of the nonhomogeneous Poisson process (NHPP) arrival times has been adapted to accelerate Monte Carlo simulations of the kinetic Ising models (KIMs) with the Glauber spin-flip dynamics. The…
Diagrammatic Monte Carlo -- the technique for numerically exact summation of all Feynman diagrams to high orders -- offers a unique unbiased probe of continuous phase transitions. Being formulated directly in the thermodynamic limit, the…
A method is presented to tackle the sign problem in the simulations of systems having indefinite or complex-valued measures. In general, this new approach is shown to yield statistical errors smaller than the crude Monte Carlo using…
Equilibrium systems evolve according to Detailed Balance (DB). This principe guided development of the Monte-Carlo sampling techniques, of which Metropolis-Hastings (MH) algorithm is the famous representative. It is also known that DB is…
We report a new multicanonical Monte Carlo (MC) algorithm to obtain the density of states (DOS) for physical systems with continuous state variables in statistical mechanics. Our algorithm is able to obtain an analytical form for the DOS…
We describe an efficient Monte Carlo algorithm using a random walk in energy space to obtain a very accurate estimate of the density of states for classical statistical models. The density of states is modified at each step when the energy…
We discuss a sampling algorithm which generates flat histogram in energy. In combination with transition matrix Monte Carlo, the density of states and derived quantities such as entropy and free energy as a function of temperature can be…
Monte Carlo simulations have boosted the numerical study of several different physical systems and in particular, the canonical ensemble has been especially useful because of the existence of easy and efficient relaxation algorithms…
In the finite-size scaling analysis of Monte Carlo data, instead of computing the observables at fixed Hamiltonian parameters, one may choose to keep a renormalization-group invariant quantity, also called phenomenological coupling, fixed…
Hamiltonian Monte Carlo is a prominent Markov Chain Monte Carlo algorithm, which employs symplectic integrators to sample from high dimensional target distributions in many applications, such as statistical mechanics, Bayesian statistics…
Monte Carlo simulation techniques, like simulated annealing and parallel tempering, are often used to evaluate low-temperature properties and find ground states of disordered systems. Here we compare these methods using direct calculations…
A new method, based on the simulated annealing algorithm and aimed at the inverse problem in the analysis of intergalactic (interstellar) complex spectra of hydrogen and metal lines, is presented. We consider the process of line formation…
With the developed "extended Monte Calro" (EMC) algorithm, we have studied the depinning transition in Ising-type lattice models by extensive numerical simulations, taking the random-field Ising model with a driving field and the driven…
Efficient sampling from high-dimensional distributions is a challenging issue which is encountered in many large data recovery problems involving Markov chain Monte Carlo schemes. In this context, sampling using Hamiltonian dynamics is one…
We introduce a Monte Carlo algorithm to efficiently compute transport properties of chaotic dynamical systems. Our method exploits the importance sampling technique that favors trajectories in the tail of the distribution of displacements,…
In this paper we propose a Monte Carlo method for generating finite-domain marginals of critical distributions of statistical models in infinite volume. The algorithm corrects the problem of the long-range effects of boundaries associated…
The Metropolis implementation of the Monte Carlo algorithm has been developed to study the equilibrium thermodynamics of many-body systems. Choosing small trial moves, the trajectories obtained applying this algorithm agree with those…