相关论文: Optimizing the ensemble for equilibration in broad…
While statisticians are well-accustomed to performing exploratory analysis in the modeling stage of an analysis, the notion of conducting preliminary general-purpose exploratory analysis in the Monte Carlo stage (or more generally, the…
Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost. Using a combination of analytical and numerical approaches, we study their convergence properties towards the steady state, within a random walk Metropolis…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
We investigate local update algorithms for the fully frustrated XY model on a square lattice. In addition to the standard updating procedures like the Metropolis or heat bath algorithm we include overrelaxation sweeps, implemented through…
We investigate the properties of two standard energy estimators used in path-integral Monte Carlo simulations. By disentangling the variance of the estimators and their autocorrelation times we analyse the dependence of the performance on…
We describe a novel simulation method that eliminates the slowing-down problem in the Monte Carlo simulations of imaginary-time path integrals near the continuum limit. This method combines a stochastic blocking procedure with the multigrid…
I propose a new algorithm, a free energy Monte Carlo algorithm, for calculations where conventional Monte Carlo simulations struggle with ergodicity problems. The simplest version of the proposed algorithm allows for the determination of…
The entanglement entropy probing novel phases and phase transitions numerically via quantum Monte Carlo has made great achievements in large-scale interacting spin/boson systems. In contrast, the numerical exploration in interacting fermion…
An efficient Monte Carlo algorithm for the simulation of spin models with long-range interactions is discussed. Its central feature is that the number of operations required to flip a spin is independent of the number of interactions…
We show how to apply the absorbing Markov chain Monte Carlo algorithm of Novotny to simulate kinetically constrained models of glasses. We consider in detail one-spin facilitated models, such as the East model and its generalizations to…
Monte Carlo simulations using entropic sampling to estimate the number of configurations of a given energy are a valuable alternative to traditional methods. We introduce {\it tomographic} entropic sampling, a scheme which uses multiple…
In this paper, we present the Monte-Carlo Compressive Optimization algorithm, a new method to solve a combinatorial optimization problem that is assumed compressible. The method relies on random queries to the objective function in order to…
We provide an algorithm that maintains, against an adaptive adversary, a $(1-\varepsilon)$-approximate maximum matching in $n$-node $m$-edge general (not necessarily bipartite) undirected graph undergoing edge deletions with high…
In complex systems with many degrees of freedom such as spin glass and biomolecular systems, conventional simulations in canonical ensemble suffer from the quasi-ergodicity problem. A simulation in generalized ensemble performs a random…
Algorithms to determine transition probabilities in Monte Carlo simulations are tested using a system of classical particles with effective interactions which reproduce Bose-Einstein statistics. The system is appropriate for testing…
We study the statistical physics of the classical Ising model in the so-called $\alpha$-R\'enyi ensemble, a finite-temperature thermal state approximation that minimizes a modified free energy based on the $\alpha$-R\'enyi entropy. We begin…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…
We propose the clock Monte Carlo technique for sampling each successive chain step in constant time. It is built on a recently proposed factorized transition filter and its core features include its O(1) computational complexity and its…
The main idea of this work is that the quantum-classical isomorphism is a suitable framework for a generalization of the notion of detailed balance. The quantum-classical isomorphism is used in order to develop a Monte Carlo simulation with…
We implement a cluster-update Monte Carlo algorithm to simulate magnetic dipoles of the XY-spin type confined in a two-dimensional plane. The long-range character and anisotropy in the dipole interaction are handled by using the…