Numerical simulations of critical lattice systems are fundamentally limited by critical slowing down, as long-range correlations are typically established through slow temporal equilibration. A physically constrained generative framework that replaces temporal relaxation with a spatial projection mechanism for critical systems is proposed. Using the two-dimensional Ising model at criticality as a benchmark, we introduce an energy-constrained kernel that synthesizes large-scale configurations from compact equilibrated seeds by enforcing Hamiltonian-level observables. The generated configurations are projected onto the nearest-neighbor energy manifold, ensuring thermodynamic consistency while retaining universal critical properties. We show that the resulting configurations reproduce scale-invariant spin correlations, Binder cumulants, and isotropic structure factors for lattice sizes exceeding 10,000, without iterative Monte Carlo equilibration. While not a strict renormalization group transformation, and motivated by renormalization ideas, the method provides a practical inverse mapping that retains universal features of criticality and enables efficient GPU-parallel generation of ultra-large critical ensembles.
Numerical simulations of critical lattice systems are fundamentally limited by critical slowing down, as long-range correlations are typically established through slow temporal equilibration. A physically constrained generative framework that replaces temporal relaxation with a spatial projection mechanism for critical systems is proposed. Using the two-dimensional Ising model at criticality as a benchmark, we introduce an energy-constrained kernel that synthesizes large-scale configurations from compact equilibrated seeds by enforcing Hamiltonian-level observables. The generated configurations are projected onto the nearest-neighbor energy manifold, ensuring thermodynamic consistency while retaining universal critical properties. We show that the resulting configurations reproduce scale-invariant spin correlations, Binder cumulants, and isotropic structure factors for lattice sizes exceeding 10,000, without iterative Monte Carlo equilibration. While not a strict renormalization group transformation, and motivated by renormalization ideas, the method provides a practical inverse mapping that retains universal features of criticality and enables efficient GPU-parallel generation of ultra-large critical ensembles.
We explore how minimal neural networks can invert the renormalization group (RG) coarse-graining procedure in the two-dimensional Ising model, effectively dreaming up microscopic configurations from coarse-grained states. This task, formally impossible at the level of configurations, can be approached probabilistically, allowing machine-learning models to reconstruct scale-invariant distributions without relying on microscopic input. We demonstrate that even neural networks with as few as three trainable parameters can learn to generate critical configurations, reproducing the scaling behavior of observables such as magnetic susceptibility, heat capacity, and Binder ratios. A real-space renormalization group analysis of the generated configurations confirms that the models capture not only scale invariance but also reproduce nontrivial eigenvalues of the RG transformation. While the inversion is necessarily imperfect, these minimal models robustly reproduce the RG-relevant structure of the critical distribution. Surprisingly, we find that increasing network complexity by introducing multiple layers offers no significant benefit. These findings suggest that simple local rules, akin to those generating fractal structures, are sufficient to encode the universality of critical phenomena, creating an opportunity for efficient generative models of statistical ensembles in physics.
This study presents a temperature-conditioned deep generative approach for efficiently generating spin configurations of the two-dimensional (2D) Ising model. The method employs a convolutional generator network, conditioned on spin states, temperature embeddings, and random noise, to generate thermodynamically accurate spin configurations on a 2D square lattice. Physics-based constraints, derived from magnetization, energy, and nearest-neighbor correlations obtained via Monte Carlo simulations, are integrated as auxiliary loss terms during training to ensure physical consistency. The model accurately captures phase transition behaviors near the critical temperature and supports the scalable generation of synthetic configurations for further analysis. Investigations across lattice sizes L=16, 32, and 64 demonstrate close alignment with Monte Carlo baselines, with generated configurations achieving mean absolute errors as low as 0.0016 for magnetization, 0.0063 for energy, and 0.0016 for correlation in the L=64 case. Phase classification using standard machine learning models further validates the quality of the generated data, with ensemble classifiers yielding F1 scores above 0.99. These findings highlight the proposed framework as a scalable, computationally efficient solution for generating spin configurations in an Ising model.
To demonstrate the application of computational physics in modern statistical physics, this paper investigates the critical behavior of a finite-size ferromagnetic system based on the two-dimensional square-lattice Ising model.A nearest-neighbor Ising Hamiltonian is constructed, and periodic boundary conditions are adopted to reduce finite-boundary effects.The Metropolis Monte Carlo algorithm is used to sample spin configurations at different temperatures, while energy, magnetization, specific heat, magnetic susceptibility and Binder cumulant are calculated to describe the transition from an ordered state to a disordered state.The simulation results show that the system exhibits clear long-range order at low temperatures, where the order parameter remains high.As temperature increases, thermal fluctuations become stronger, magnetization decreases rapidly, and the system gradually evolves into a disordered state.The specific heat curve shows a pronounced peak at approximately (T = 2.269), while the susceptibility peak shifts slightly toward the high-temperature side due to finite-size effects and the discrete temperature grid.Overall, the simulated critical region is consistent with the theoretical critical temperature of the two-dimensional square-lattice Ising model.Spin-configuration analysis further reveals enhanced fluctuations and domain reconstruction near the critical region.In addition, a thermalization criterion and an extended sampling test for L = 48 near the critical region are added to examine the influence of finite sampling and equilibration.These results indicate that Monte Carlo simulation of the two-dimensional Ising model can effectively reproduce continuous phase transition, critical fluctuation and finite-size effects, providing a basic computational case for understanding critical phenomena in complex systems and data-driven physical analysis.
Criticality and symmetry, studied by the renormalization groups, lie at the heart of modern physics theories of matters and complex systems. However, surveying these properties with massive experimental data is bottlenecked by the intolerable costs of computing renormalization groups on real systems. Here, we develop a time- and memory-efficient framework, termed as the random renormalization group, for renormalizing ultra-large systems (e.g., with millions of units) within minutes. This framework is based on random projections, hashing techniques, and kernel representations, which support the renormalization governed by linear and non-linear correlations. For system structures, it exploits the correlations among local topology in kernel spaces to unfold the connectivity of units, identify intrinsic system scales, and verify the existences of symmetries under scale transformation. For system dynamics, it renormalizes units into correlated clusters to analyze scaling behaviours, validate scaling relations, and investigate potential criticality. Benefiting from hashing-function-based designs, our framework significantly reduces computational complexity compared with classic renormalization groups, realizing a single-step acceleration of two orders of magnitude. Meanwhile, the efficient representation of different kinds of correlations in kernel spaces realized by random projections ensures the capacity of our framework to capture diverse unit relations. As shown by our experiments, the random renormalization group helps identify non-equilibrium phase transitions, criticality, and symmetry in diverse large-scale genetic, neural, material, social, and cosmological systems.
Abstract Criticality and symmetry, studied by the renormalization groups, lie at the heart of modern physics theories of matters and complex systems. However, surveying these properties with massive experimental data is bottlenecked by the intolerable costs of computing renormalization groups on real systems. Here, we develop a time- and memory-efficient framework, termed as the random renormalization group, for renormalizing ultra-large systems (e.g., with millions of units) within minutes. This framework is based on random projections, hashing techniques, and kernel representations, which support the renormalization governed by linear and non-linear correlations. For system structures, it exploits the correlations among local topology in kernel spaces to unfold the connectivity of units, identify intrinsic system scales, and verify the existences of symmetries under scale transformation. For system dynamics, it renormalizes units into correlated clusters to analyze scaling behaviours, validate scaling relations, and investigate potential criticality. Benefiting from hashing-function-based designs, our framework significantly reduces computational complexity compared with classic renormalization groups, realizing a single-step acceleration of two orders of magnitude. Meanwhile, the efficient representation of different kinds of correlations in kernel spaces realized by random projections ensures the capacity of our framework to capture diverse unit relations. As shown by our experiments, the random renormalization group helps identify non-equilibrium phase transitions, criticality, and symmetry in diverse large-scale genetic, neural, material, social, and cosmological systems.
Recently, a novel real-space renormalization group (RG) algorithm was introduced. By maximizing an information-theoretic quantity, the real-space mutual information, the algorithm identifies the relevant low-energy degrees of freedom. Motivated by this insight, we investigate the information-theoretic properties of coarse-graining procedures for both translationally invariant and disordered systems. We prove that a perfect real-space mutual information coarse graining does not increase the range of interactions in the renormalized Hamiltonian, and, for disordered systems, it suppresses the generation of correlations in the renormalized disorder distribution, being in this sense optimal. We empirically verify decay of those measures of complexity as a function of information retained by the RG, on the examples of arbitrary coarse grainings of the clean and random Ising chain. The results establish a direct and quantifiable connection between properties of RG viewed as a compression scheme and those of physical objects, i.e., Hamiltonians and disorder distributions. We also study the effect of constraints on the number and type of coarse-grained degrees of freedom on a generic RG procedure.