Efficient predecision scheme for Metropolis Monte Carlo simulation of long-range interacting lattice systems
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909735858470912 |
|---|---|
| author | Müller, Fabio Janke, Wolfhard |
| author_facet | Müller, Fabio Janke, Wolfhard |
| contents | We propose a fast and general predecision scheme for Metropolis Monte Carlo simulation of $d$-dimensional long-range interacting lattice models. For potentials of the form $V(r)=r^{-d-σ}$, this reduces the computational complexity from $O\left(N^2\right)$ to $O\left(N^{2-σ/d}\right)$ for $σ< d$ and to $O\left(N \right)$ for $σ> d$, respectively. The algorithm is implemented and tested for several $\mathrm{O}(n)$ spin models ranging from the Ising over the XY to the Edwards-Anderson spin-glass model. With the same random number sequence it produces exactly the same Markov chain as a simulation with explicit summation of all terms in the Hamiltonian. Due to its generality, its simplicity, and its reduced computational complexity it has the potential to find broad application and thus lead to a deeper understanding of the role of long-range interactions in the physics of lattice models, especially in nonequilibrium settings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_09775 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient predecision scheme for Metropolis Monte Carlo simulation of long-range interacting lattice systems Müller, Fabio Janke, Wolfhard Statistical Mechanics Computational Physics We propose a fast and general predecision scheme for Metropolis Monte Carlo simulation of $d$-dimensional long-range interacting lattice models. For potentials of the form $V(r)=r^{-d-σ}$, this reduces the computational complexity from $O\left(N^2\right)$ to $O\left(N^{2-σ/d}\right)$ for $σ< d$ and to $O\left(N \right)$ for $σ> d$, respectively. The algorithm is implemented and tested for several $\mathrm{O}(n)$ spin models ranging from the Ising over the XY to the Edwards-Anderson spin-glass model. With the same random number sequence it produces exactly the same Markov chain as a simulation with explicit summation of all terms in the Hamiltonian. Due to its generality, its simplicity, and its reduced computational complexity it has the potential to find broad application and thus lead to a deeper understanding of the role of long-range interactions in the physics of lattice models, especially in nonequilibrium settings. |
| title | Efficient predecision scheme for Metropolis Monte Carlo simulation of long-range interacting lattice systems |
| topic | Statistical Mechanics Computational Physics |
| url | https://arxiv.org/abs/2508.09775 |