Self-Avoiding Random Dynamics on Integer Complex Systems
From MaRDI portal
Publication:4635213
Abstract: 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.
Recommendations
- scientific article; zbMATH DE number 503494
- Dynamics of systems on infinite lattices
- Publication:4952341
- Dynamical behavior for stochastic lattice systems
- On the dynamics of complex systems with random fluctuations. A statistical field theory approach
- Self-avoiding process on the Sierpinski gasket
- Random walks and coupling in complex systems
- scientific article; zbMATH DE number 1222119
- Embedded random matrix ensembles for complexity and chaos in finite interacting particle systems
This page was built for publication: Self-Avoiding Random Dynamics on Integer Complex Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635213)