Precision Evaluation Criteria for Simulation Algorithms in Infinite Systems: A Network Model-Based Approach
Yonglong Ding

TL;DR
This paper introduces a network model-based framework to evaluate the accuracy limits of simulation algorithms in infinite systems, demonstrating persistent error bounds and extending the approach to molecular dynamics and battery systems.
Contribution
It provides a novel method to convert infinite systems into finite network models for rigorous error analysis, applicable across different simulation types.
Findings
Error bounds remain finite even as system size approaches infinity.
The methodology is applicable to both Ising model and molecular dynamics simulations.
Potential energy can be efficiently estimated from macro-level data.
Abstract
As the particle count escalates, the computational demands of diverse simulation algorithms surge, paralleled by a marked enhancement in accuracy. The question arises whether this heightened precision asymptotically dwindles towards zero or plateaus at a finite constant. To address this, this work introduces an approach that translates infinite systems into finite-node network architectures, providing a rigorous framework for assessing this question. Employing the Monte Carlo algorithm's application to the Ising model as a case study, this paper demonstrate that despite the simulation's extension to an infinite lattice size, a fundamental error bound persists. This work explicitly derive this lower bound on the error, offering a quantitative understanding of the algorithm's limitations in the limit of infinite scale. Furthermore, I extend this methodology to Molecular Dynamics…
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
TopicsSimulation Techniques and Applications
