The structure of emulations in classical spin models: modularity and universality

DOI10.1063/5.0252369MaRDI QIDQ7311693zbMATH OpenFDO

Authors Tobias Reinhart, Benjamin Engel, Gemma De les Coves

Publication date 11 August 2026

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/5.0252369

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Neural nets applied to problems in time-dependent statistical mechanics (82C32)

Cites work

• A framework for universality in physics, computer science, and beyond
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Characterization of grid graphs
• Complexity Theory
• Elements of phase transitions and critical phenomena
• Gadgets, Approximation, and Linear Programming
• Mixing time for the Ising model: a uniform lower bound for all graphs
• Random generation of combinatorial structures from a uniform distribution
• Representational Power of Restricted Boltzmann Machines and Deep Belief Networks
• The computational hardness of counting in two-spin models on d-regular graphs
• The mixing time evolution of Glauber dynamics for the mean-field Ising model
• The nature of computation
• Time-Dependent Statistics of the Ising Model
• Translationally invariant universal classical Hamiltonians
• Universal quantum Hamiltonians
• Viruses as complex adaptive systems

This page was built for publication: The structure of emulations in classical spin models: modularity and universality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7311693)