The geometric signatures of macroscopic interfaces in the two-dimensional critical Ising model strictly adhere to Schramm–Loewner Evolution (SLE) theory. In this study, we propose a physics-driven generative approach using Super-Resolution Generative Adversarial Networks (SRGANs) to approximate the inverse coarse-graining operation to generate larger configurations. From the perspective of Geometric Deep Learning (GDL), we leverage the geometric priors of Convolutional Neural Networks (CNNs)—specifically their translational and rotational symmetries—to effectively encode the universal physical laws of the Ising Hamiltonian. This inductive bias allows the model to be trained on small scales yet be generalized to large-scale systems () while preserving physical conservation. To accommodate spin discreteness, we employ an L1-based loss function to maintain domain wall sharpness. SLE analysis and long-range correlation functions confirm that the model reproduces critical dynamics and conformal invariance, successfully serving as a physics-preserving inverse coarse-graining transformation framework.
The Domany Kinzel (DK) model encompasses several types of non-equilibrium phase transitions, depending on the selected parameters. We apply supervised, semi-supervised, and unsupervised learning methods to studying the phase transitions and critical behaviors of the (1 + 1)-dimensional DK model. The supervised and the semi-supervised learning methods permit the estimations of the critical points, the spatial and temporal correlation exponents, concerning labelled and unlabelled DK configurations, respectively. Furthermore, we also predict the critical points by employing principal component analysis (PCA) and autoencoder. The PCA and autoencoder can produce results in good agreement with simulated particle number density.
The local rules of elementary cellular automata (ECA) with one-dimensional three-cell neighborhoods are represented by eight-bit binary numbers that encode deterministic update rules. This class of systems is also commonly referred to as the Wolfram cellular automata. These automata are widely utilized to investigate self-organization phenomena and the dynamics of complex systems. In this work, we employ numerical simulations and computational methods to investigate the asymptotic density and dynamical evolution mechanisms in Wolfram automata. We explore alternative initial conditions under which certain Wolfram rules generate similar fractal patterns over time, even when starting from a single active site. Our results reveal the relationship between the asymptotic density and the initial density of selected rules. Furthermore, we apply both supervised and unsupervised learning methods to identify the configurations associated with different Wolfram rules. The supervised learning methods effectively identify the configurations of various Wolfram rules, while unsupervised methods like principal component analysis and autoencoders can approximately cluster configurations of different Wolfram rules into distinct groups, yielding results that align well with simulated density outputs. Machine learning methods offer significant advantages in identifying different Wolfram rules, as they can effectively distinguish highly similar configurations that are challenging to differentiate manually.