Related papers: Particle density and critical point for studying site percolation by finite size scaling

Particle density and critical point for studying site percolation by finite size scaling

URL: http://arxiv.org/abs/2311.14725v2
Date: Wed, 8 May 2024 14:13:14 GMT
Title: Particle density and critical point for studying site percolation by finite size scaling
Authors: Dian Xu, Shanshan Wang, Feng Gao, Wei Li, Jianmin Shen,
Abstract summary: We study the relationship between particle number density, critical point, and latent variables in the site percolation model. Unsupervised learning yields reliable results consistent with Monte Carlo simulations.
Score: 6.449416869164504
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Machine learning has recently achieved remarkable success in studying phase transitions. It is generally believed that the latent variables of unsupervised learning can capture the information related to phase transitions, which is usually achieved through the so-called order parameter. In most models, for instance the Ising, the order parameters are simply the particle number densities. The percolation, the simplest model which can generate a phase transition, however, has a unique order parameter which is not particle number density. In this paper, we use unsupervised learning to study the relationship between particle number density, critical point, and latent variables in the site percolation model. It is found that if the input of learning is the original configuration, then the output of unsupervised learning does not convey any information related to the phase transition. Therefore, the maximum cluster is employed in order to effectively capture the critical point of the model. Unsupervised learning yields reliable results consistent with Monte Carlo simulations. We also propose a method called Fake Finite Size Scaling (FFSS) to calculate the critical value, which improves the accuracy of fitting to a great extent.

Related papers

Gradient-Based Feature Learning under Structured Data [57.76552698981579]
In the anisotropic setting, the commonly used spherical gradient dynamics may fail to recover the true direction. We show that appropriate weight normalization that is reminiscent of batch normalization can alleviate this issue. In particular, under the spiked model with a suitably large spike, the sample complexity of gradient-based training can be made independent of the information exponent.
arXiv Detail & Related papers (2023-09-07T16:55:50Z)
Particle-Based Score Estimation for State Space Model Learning in Autonomous Driving [62.053071723903834]
Multi-object state estimation is a fundamental problem for robotic applications. We consider learning maximum-likelihood parameters using particle methods. We apply our method to real data collected from autonomous vehicles.
arXiv Detail & Related papers (2022-12-14T01:21:05Z)
Fundamental limits to learning closed-form mathematical models from data [0.0]
Given a noisy dataset, when is it possible to learn the true generating model from the data alone? We show that this problem displays a transition from a low-noise phase in which the true model can be learned, to a phase in which the observation noise is too high for the true model to be learned by any method.
arXiv Detail & Related papers (2022-04-06T10:00:33Z)
Transfer learning of phase transitions in percolation and directed percolation [2.0342076109301583]
We apply domain adversarial neural network (DANN) based on transfer learning to studying non-equilibrium and equilibrium phase transition models. The DANN learning of both models yields reliable results which are comparable to the ones from Monte Carlo simulations.
arXiv Detail & Related papers (2021-12-31T15:24:09Z)
A learning algorithm with emergent scaling behavior for classifying phase transitions [0.0]
We introduce a supervised learning algorithm for studying critical phenomena from measurement data. We test it on the transverse field Ising chain and q=6 Potts model. Our algorithm correctly identifies the thermodynamic phase of the system and extracts scaling behavior from projective measurements.
arXiv Detail & Related papers (2021-03-29T18:05:27Z)
Contrastive learning of strong-mixing continuous-time stochastic processes [53.82893653745542]
Contrastive learning is a family of self-supervised methods where a model is trained to solve a classification task constructed from unlabeled data. We show that a properly constructed contrastive learning task can be used to estimate the transition kernel for small-to-mid-range intervals in the diffusion case.
arXiv Detail & Related papers (2021-03-03T23:06:47Z)
Unsupervised machine learning of topological phase transitions from experimental data [52.77024349608834]
We apply unsupervised machine learning techniques to experimental data from ultracold atoms. We obtain the topological phase diagram of the Haldane model in a completely unbiased fashion. Our work provides a benchmark for unsupervised detection of new exotic phases in complex many-body systems.
arXiv Detail & Related papers (2021-01-14T16:38:21Z)
Emergence of a finite-size-scaling function in the supervised learning of the Ising phase transition [0.7658140759553149]
We investigate the connection between the supervised learning of the binary phase classification in the ferromagnetic Ising model and the standard finite-size-scaling theory of the second-order phase transition. We show that just one free parameter is capable enough to describe the data-driven emergence of the universal finite-size-scaling function in the network output.
arXiv Detail & Related papers (2020-10-01T12:34:12Z)
Interpolation and Learning with Scale Dependent Kernels [91.41836461193488]
We study the learning properties of nonparametric ridge-less least squares. We consider the common case of estimators defined by scale dependent kernels.
arXiv Detail & Related papers (2020-06-17T16:43:37Z)
Unsupervised machine learning of quantum phase transitions using diffusion maps [77.34726150561087]
We show that the diffusion map method, which performs nonlinear dimensionality reduction and spectral clustering of the measurement data, has significant potential for learning complex phase transitions unsupervised. This method works for measurements of local observables in a single basis and is thus readily applicable to many experimental quantum simulators.
arXiv Detail & Related papers (2020-03-16T18:40:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.