Yanyang Wang

Yanyang Wang

Auto-generated profile, based on publicly available information

Yanyang Wang


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 February 2024 in Machine Learning: Science and Technology
Verified
Journal Article
Open access
YWYanyang Wang
Yanyang Wang
WLWei Li
Wei Li
Feiyi LiuFeiyi Liu
Feiyi Liu
JSJianmin Shen
Jianmin Shen
Machine learning (ML) of phase transitions (PTs) has gradually become an effective approach that enables us to explore the nature of various PTs more promptly in equilibrium and nonequilibrium systems. Unlike equilibrium systems, non-equilibrium systems display more complicated and diverse features because of the extra dimension of time, which is not readily tractable, both theoretically and numerically. The combination of ML and most renowned nonequilibrium model, directed percolation (DP), led to some significant findings. In this study, ML is applied to ( 1 + 1 ) -d, even offspring branching annihilating random walks (BAW), whose universality class is not DP-like. The supervised learning of ( 1 + 1 ) -d BAW via convolutional neural networks (CNN) results in a more accurate prediction of the critical point than the Monte Carlo (MC) simulation for the same system sizes. The dynamic exponent z and spatial correlation length correlation exponent ν ⊥ were also measured and found to be consistent with their respective theoretical values. Furthermore, the unsupervised learning of ( 1 + 1 ) -d BAW via an autoencoder (AE) gives rise to a transition point, which is the same as the critical point. The latent layer of AE, through a single neuron, can be regarded as the order parameter of the system being properly re-scaled. Therefore, we believe that ML has exciting application prospects in reaction-diffusion systems such as BAW and DP.

25 February 2025 in Machine Learning: Science and Technology
Verified
Journal Article
Open access
YWYanyang Wang
Yanyang Wang
YYYuxiang Yang
Yuxiang Yang
WLWei Li
Wei Li
Determining the universality class of reaction–diffusion processes with long-range interactions in non-equilibrium phase transitions is both challenging and intriguing. Identifying critical points is fundamental for studying the phase transition characteristics of these universality classes. Unlike Monte Carlo simulations of statistical system observables, machine learning methods can extract evolutionary information from clusters of such systems, enabling a faster approach to phase transition regions. We developed a method that uses the one-dimensional encoding output of a stacked autoencoder (SAE) to determine the critical point in systems undergoing (1+1)-dimensional directed percolation with spatial long-range interactions. We validate this method by examining the power-law behavior of particle density at the critical point, which strongly supports our approach. As the system adheres to the scaling relation t f ∼ L z at the critical point, we conducted extensive simulations at this critical probability to determine the dynamic exponent z. In addition, the SAE is also capable of identifying the characteristic time of critical states. Finally, we tested two other heavy-tailed distributions that generate random step lengths: the Lévy distribution and the Cauchy distribution, which introduce different global spreading mechanisms. This method remains effective for determining the critical points in these systems. Our findings highlight the promising applications of SAE techniques for processes involving long-range interactions.

14 November 2025 in Entropy
Verified
Journal Article
Open access
PDF file
KTKui Tuo
Kui Tuo
Shengfeng DengShengfeng Deng
Shengfeng Deng
YYYuxiang Yang
Yuxiang Yang
YWYanyang Wang
Yanyang Wang
QWQiuping A. Wang
Qiuping A. Wang
WZWenjun Zhang
Wenjun Zhang
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.

31 March 2026 in Entropy
Verified
Journal Article
Open access
PDF file
YYYuxiang Yang
Yuxiang Yang
WLWei Li
Wei Li
YWYanyang Wang
Yanyang Wang
ZLZhihang Liu
Zhihang Liu
KTKui Tuo
Kui Tuo
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 (2048 × 2048) 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.

21 September 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
YZYin-Tao Zou
Yin-Tao Zou
YWYanyang Wang
Yanyang Wang
WLWei Li
Wei Li
Determining critical points and scaling remains central in statistical physics. We study two representative (1+1)-dimensional absorbing-state models: directed percolation (DP) and branching-annihilating random walks with even offspring (BARWe), belonging to the DP and parity-conserving universality classes. Using diffusion maps on Monte Carlo lattice configurations, we estimate pseudocritical points and analyze temporal spectral behavior. The leading scan coordinate identifies crossovers near the reference critical points, while the temporal spectral distance is strongly correlated with particle density, with R = 0.9999 for DP and R = 0.9978 for BARWe. Within the examined time windows, the critical decay is qualitatively consistent with the reference slopes -0.1595 and -0.285. Higher spectral modes vary nontrivially near criticality, and finite-size results show increasingly localized crossovers. These results demonstrate that diffusion maps can extract low-dimensional spectral observables associated with the density order parameter and characterize critical regions in absorbing-state phase transitions.

18 March 2026 in Physics Letters A
Verified
Journal Article
Closed access
YWYanyang Wang
Yanyang Wang
YYYuxiang Yang
Yuxiang Yang
WLWei Li
Wei Li