Self-Avoiding Random Dynamics on Integer Complex Systems

Details Self-Avoiding Random Dynamics on Integer Complex Systems Self-Avoiding Random Dynamics on Integer Complex Systems

2011-11-23

arxiv.org/abs/1111.5379v2

Statistics

Computation

22 pages. 9 figures

Scientific paper

This paper introduces a new specialized algorithm for equilibrium Monte Carlo sampling of binary-valued systems, which allows for large moves in the state space. This is achieved by constructing self-avoiding walks (SAWs) in the state space. As a consequence, many bits are flipped in a single MCMC step. We name the algorithm SARDONICS, an acronym for Self-Avoiding Random Dynamics on Integer Complex Systems. The algorithm has several free parameters, but we show that Bayesian optimization can be used to automatically tune them. SARDONICS performs remarkably well in a broad number of sampling tasks: toroidal ferromagnetic and frustrated Ising models, 3D Ising models, restricted Boltzmann machines and chimera graphs arising in the design of quantum computers.

Affiliated with

Also associated with

No associations

Rating

Self-Avoiding Random Dynamics on Integer Complex Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-Avoiding Random Dynamics on Integer Complex Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Avoiding Random Dynamics on Integer Complex Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376450