Nearly accurate solutions for Ising-like models using Maximal Entropy Random Walk
Jarek Duda

TL;DR
This paper introduces an analytical approach using Maximal Entropy Random Walk to efficiently approximate solutions for higher-dimensional Ising-like models, achieving near-accurate results with minimal computational effort.
Contribution
It develops a novel method combining lattice approximation and MERW to compute local statistical models for Ising-like systems efficiently.
Findings
Achieves about 0.02 error in entropy and energy near critical points.
Requires seconds on a laptop for computations.
Provides extremely accurate results (~10^{-10} error) at certain parameters.
Abstract
While one-dimensional Markov processes are well understood, going to higher dimensions there are only a few analytically solved Ising-like models, in practice requiring to use relatively costly, uncontrollable and inaccurate Monte-Carlo methods. There is discussed analytical approach for e.g. approximation of lattice, also exploiting Hammersley-Clifford theorem to generate random Gibbs/Markov field through scanning line-by-line using local statistical model as in lossless image compression. While its conditional distributions could be found with Monte-Carlo methods, there is discussed use of Maximal Entropy Random Walk (MERW) to calculate them from approximation of lattice as infinite in one direction and finite in the remaining. Specifically, in the finite directions there is built alphabet of all patterns, then transition matrix containing energy for all pairs of…
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 · Neural Networks and Applications · Algorithms and Data Compression
