Statistical properties of worm algorithms for two dimensional frustrated Ising models
Geet Rakala, Kedar Damle, Deepak Dhar

TL;DR
This paper investigates the statistical properties of worm algorithms in frustrated 2D Ising models, revealing their connection to fractional Brownian motion and deriving universal scaling relations for their dynamical behavior.
Contribution
It establishes a universal relation between the dynamical and persistence exponents of worm algorithms, linking their behavior to the underlying critical phase properties.
Findings
The dynamical exponent z is greater than 2, indicating subdiffusive behavior.
The position distribution of the worm follows an equilibrium distribution in a logarithmic potential.
The exponents are consistent with a fractional Brownian motion model.
Abstract
We study the distribution of lengths and other statistical properties of worms constructed by Monte Carlo worm algorithms in the power-law three-sublattice ordered phase of frustrated triangular and kagome lattice Ising antiferromagnets. Viewing each step of the worm construction as a position increment (step) of a random walker, we demonstrate that the persistence exponent and the dynamical exponent of this random walk depend only on the universal power-law exponents of the underlying critical phase, and not on the details of the worm algorithm or the microscopic Hamiltonian. Further, we argue that the detailed balance criterion obeyed by such worm algorithms and the power-law correlations of the underlying equilibrium system together give rise to two related properties of this random walk: First, the steps of the walk are expected to be power-law correlated in time.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTheoretical and Computational Physics · Complex Systems and Time Series Analysis · Complex Network Analysis Techniques
