Related papers: Multihistogram Reweighting for Nonequilibrium Mark…
We investigate the lattice spacing dependence of the equilibration time for a recently proposed multiscale thermalization algorithm for Markov chain Monte Carlo simulations. The algorithm uses a renormalization-group matched coarse lattice…
We study an irreversible Markov chain Monte Carlo method based on a skew detailed balance condition for an one-dimensional Ising model. Dynamical behavior of the magnetization density is analyzed in order to understand the properties of…
In this paper, we study the asymptotic variance of sample path averages for inhomogeneous Markov chains that evolve alternatingly according to two different $\pi$-reversible Markov transition kernels $P$ and $Q$. More specifically, our main…
We present two algorithms by which a set of short, unbiased trajectories can be iteratively reweighted to obtain various observables. The first algorithm estimates the stationary (steady state) distribution of a system by iteratively…
Computer simulations generate trajectories at a single, well-defined thermodynamic state point. Statistical reweighting offers the means to reweight static and dynamical properties to different equilibrium state points by means of analytic…
This paper shows a simple implementation of the Histogram Method for extrapolations in Monte Carlo simulations, using the moments of the operators that define the energy, instead of their histogram. This implementation is suitable for…
We discuss how maximum entropy methods may be applied to the reconstruction of Markov processes underlying empirical time series and compare this approach to usual frequency sampling. It is shown that, at least in low dimension, there…
Convergence analysis of Markov chain Monte Carlo methods in high-dimensional statistical applications is increasingly recognized. In this paper, we develop general mixing time bounds for Metropolis-Hastings algorithms on discrete spaces by…
Importance sampling is a variance reduction technique for efficient estimation of rare-event probabilities by Monte Carlo. In standard importance sampling schemes, the system is simulated using an a priori fixed change of measure suggested…
We combine histogram reweighting techniques with the two-lattice matching Monte Carlo renormalization group method to conduct computationally efficient calculations of critical exponents on systems with moderately small lattice sizes. The…
We study an induced dynamics in the space of energy of single-spin-flip Monte Carlo algorithm. The method gives an efficient reweighting technique. This dynamics is shown to have relaxation times proportional to the specific heat. Thus, it…
Metropolis Monte Carlo simulation is a powerful tool for studying the equilibrium properties of matter. In complex condensed-phase systems, however, it is difficult to design Monte Carlo moves with high acceptance probabilities that also…
We introduce a Metropolis-Hastings Markov chain for Boltzmann distributions of classical spin systems. It relies on approximate tensor network contractions to propose correlated collective updates at each step of the evolution. We present…
We present extensive Monte Carlo simulations on a two-dimensional XY model with a modified form of interaction potential. Thermodynamic quantities other than energy, specific heat etc (such as magnetization, susceptibility, fourth order…
Switching dynamical systems are an expressive model class for the analysis of time-series data. As in many fields within the natural and engineering sciences, the systems under study typically evolve continuously in time, it is natural to…
This article proposes a Bayesian nonparametric method for forecasting, imputation, and clustering in sparsely observed, multivariate time series data. The method is appropriate for jointly modeling hundreds of time series with widely…
Importance sampling and independent Metropolis-Hastings (IMH) are among the fundamental building blocks of Monte Carlo methods. Both require a proposal distribution that globally approximates the target distribution. The Radon-Nikodym…
Various Markov chain Monte Carlo (MCMC) methods are studied to improve upon random walk Metropolis sampling, for simulation from complex distributions. Examples include Metropolis-adjusted Langevin algorithms, Hamiltonian Monte Carlo, and…
We propose an efficient Markov Chain Monte Carlo method for sampling equilibrium distributions for stochastic lattice models, capable of handling correctly long and short-range particle interactions. The proposed method is a Metropolis-type…
This paper presents an improved implicit sampling method for hierarchical Bayesian inverse problems. A widely used approach for sampling posterior distribution is based on Markov chain Monte Carlo (MCMC). However, the samples generated by…