Scanning probe experiments such as scanning tunneling microscopy (STM) and atomic force microscopy (AFM) on strongly correlated materials often reveal complex pattern formation that occurs on multiple length scales. We have shown in two disparate correlated materials that the pattern formation is driven by proximity to a disorder-driven critical point. We developed new analysis concepts and techniques that relate the observed pattern formation to critical exponents by analyzing the geometry and statistics of clusters observed in these experiments and converting that information into critical exponents. Machine learning algorithms can be helpful correlating data from scanning probe experiments to theoretical models of pattern formation. We analyze the use of machine learning algorithms for the identification of critical behavior and universality underlying scanning probe data sets taken from correlated materials. This method has complementary strengths to the cluster analysis methods. The cluster techniques have a clear physical interpretation while machine learning algorithms require less expertise from the user and are faster to implement. The complementary nature of the two techniques further facilitates our understanding of correlated materials. The training of machine learning algorithms has been done through artificial neural networks. The neural net was trained using data from theoretical simulations of percolation and Ising models. The trained net had a 3.00% average classification error during testing. This proves that machine learning algorithms can successfully distinguish whether the complex pattern formation of a specific novel material is governed by uncorrelated percolation or by an interaction model fixed point.
Scanning probe experiments such as scanning tunneling microscopy (STM) and atomic force microscopy (AFM) on strongly correlated materials often reveal complex pattern formation that occurs on multiple length scales. We have shown in two disparate correlated materials that the pattern formation is driven by proximity to a disorder-driven critical point. We developed new analysis concepts and techniques that relate the observed pattern formation to critical exponents by analyzing the geometry and statistics of clusters observed in these experiments and converting that information into critical exponents. Machine learning algorithms can be helpful correlating data from scanning probe experiments to theoretical models of pattern formation. We analyze the use of machine learning algorithms for the identification of critical behavior and universality underlying scanning probe data sets taken from correlated materials. This method has complementary strengths to the cluster analysis methods. The cluster techniques have a clear physical interpretation while machine learning algorithms require less expertise from the user and are faster to implement. The complementary nature of the two techniques further facilitates our understanding of correlated materials. The training of machine learning algorithms has been done through artificial neural networks. The neural net was trained using data from theoretical simulations of percolation and Ising models. The trained net had a 3.00% average classification error during testing. This proves that machine learning algorithms can successfully distinguish whether the complex pattern formation of a specific novel material is governed by uncorrelated percolation or by an interaction model fixed point.
Abstract Studying percolation phase transitions offers valuable insights into the characteristics of phase transitions, shedding light on the underlying mechanisms that govern the formation of global connectivity within a system. We explore the percolation phase transition in the 3D cubic Ising model by employing two machine learning techniques. Our results demonstrate that machine learning methods can distinguish different phases during the percolation transition. Through the finite-size scaling analysis on the output of the neural networks, the percolation temperature and a correlation length exponent in the geometrical percolation transition are extracted and compared to those in the thermal magnetization phase transition within the 3D Ising model. These findings provide a valuable method for enhancing our understanding of the properties of the QCD critical point, which belongs to the same universality class as the 3D Ising model.
Scanning probes reveal complex, inhomogeneous patterns on the surface of many condensed matter systems. In some cases, the patterns form self-similar, fractal geometric clusters. In this paper, we advance the theory of criticality as it pertains to those geometric clusters (defined as connected sets of nearest-neighbor aligned spins) in the context of Ising models. We show how data from surface probes can be used to distinguish whether electronic patterns observed at the surface of a material are confined to the surface, or whether the patterns originate in the bulk. Whereas thermodynamic critical exponents are derived from the behavior of Fortuin–Kasteleyn (FK) clusters, critical exponents can be similarly defined for geometric clusters. We find that these geometric critical exponents are not only distinct numerically from the thermodynamic and uncorrelated percolation exponents, but that they separately satisfy scaling relations at the critical fixed points discussed in the text. We furthermore find that the two-dimensional (2D) cross-sections of geometric clusters in the three-dimensional (3D) Ising model display critical scaling behavior at the bulk phase transition temperature. In particular, we show that when considered on a 2D slice of a 3D system, the pair connectivity function familiar from percolation theory displays more robust critical behavior than the spin-spin correlation function, and we calculate the corresponding critical exponent. We discuss the implications of these two distinct length scales in Ising models. We also calculate the pair connectivity exponent in the clean 2D case. These results extend the theory of geometric criticality in the clean Ising universality classes, and facilitate the broad application of geometric cluster analysis techniques to maximize the information that can be extracted from scanning image probe data in condensed matter systems.
The identification and characterization of phase transitions is one of the oldest and most central problems in condensed matter physics, traditionally approached through order parameters, free-energy expansions, renormalization-group analysis, and direct numerical simulation. Over the past decade, machine learning (ML) has emerged as a complementary and, in some regimes, transformative methodology for this task. Supervised classifiers can learn to distinguish phases directly from raw configurations without an a priori order parameter; unsupervised and self-supervised techniques such as principal component analysis, autoencoders, and learning-by-confusion can locate transition points with minimal or no labeled data; and generative and variational architectures, including neural-network quantum states, now approximate ground-state wavefunctions of strongly correlated systems well beyond the reach of exact diagonalization. This paper reviews the theoretical foundations of phase transitions relevant to machine-learning applications, surveys the principal families of algorithms used to detect and classify phases, and examines their application across classical spin systems, percolation, topological and quantum phases, strongly correlated electron systems, and experimentally measured spectroscopic data. Representative case studies are discussed, including convolutional and graph-neural-network classifiers of lattice configurations, explainable-ML detection of thermodynamic transitions in photoemission spectra, and deep-learning-guided discovery of high-temperature superconductors. The review closes with a critical discussion of persistent challenges interpretability, data scarcity in correlated-electron experiments, generalization across Hamiltonians, and the reliability of learned order parameters near criticality and outlines directions for future research, including physics-informed architectures, uncertainty quantification, and closed-loop integration with autonomous experimentation.
Machine-learning-inspired techniques have emerged as a new paradigm for analysis of phase transitions in quantum matter.In this work, we introduce a supervised learning algorithm for studying critical phenomena from measurement data, "neural network scaling," which is based on iteratively training convolutional networks of increasing (spatial) complexity and test it on the transverse field Ising chain and q = 6 Potts model.At the continuous Ising transition, our scaling procedure directly reflects the hallmark of a continuous (second-order) phase transition, divergence of a characteristic length scale.Specifically, we extract a classification length scale by measuring the response of the classification accuracy while varying the largest convolution size (architecture of the network).We observe empirically the scaling exponent of the classification length is consistent with a power law with the correlation length exponent ν = 1.Furthermore, we demonstrate the versatility of our algorithm by showing the universal scaling behaviors persist across a variety of measurement bases, including when the order parameter is nonlocal.Finally, we show that the classification length scale remains finite for the q = 6 Potts model, which has a first-order transition and lacks a divergent correlation length.
We investigate phase transitions in the two-dimensional Ising model with competing nearest-neighbor (NN) and next-nearest-neighbor (NNN) interactions, where the NNN coupling generates a degenerate superantiferromagnetic (SAF) ground state, by combining machine-learning methods with Monte Carlo simulations and finite-size scaling (FSS). Going beyond earlier studies, we show that unsupervised learning can recover order-parameter and Binder cumulant analogs that obey FSS. Principal component analysis (PCA) reveals the two-component structure of the SAF order parameter, and k-means clustering is used to visualize qualitative differences between ordered and disordered configurations in the principal-component space. A fully connected neural network (FCNN), trained without prior knowledge of the order parameter or the critical temperature, learns the strength of SAF stripe ordering and uses it as the internal feature for phase classification. FSS of thermodynamic observables, the PCA-derived quantity, and the FCNN output yields consistent estimates of the critical temperature and correlation-length exponent. These results demonstrate that machine learning can decode ordering patterns, extract meaningful order-parameter analogs, and reproduce critical behavior in frustrated Ising systems.
In this study, we computed three critical exponents (α,β,γ) for the 3D Ising model with Metropolis Algorithm using Finite-Size Scaling Analysis on six cube length scales (L=20,30,40,60,80,90), and performed a supervised Deep Learning (DL) approach (3D Convolutional Neural Network or CNN) to train a neural network on specific conformations of spin states. We find one can effectively reduce the information in thermodynamic ensemble-averaged quantities vs. reduced temperature t (magnetization per spin (t), specific heat per spin (t), magnetic susceptibility per spin <χ>(t)) to \textit{six} latent classes. We also demonstrate our CNN on a subset of L=20 conformations and achieve a train/test accuracy of 0.92 and 0.6875, respectively. However, more work remains to be done to quantify the feasibility of computing critical exponents from the output class labels (binned m,c,χ) from this approach and interpreting the results from DL models trained on systems in Condensed Matter Physics in general.