ترغب بنشر مسار تعليمي؟ اضغط هنا

Quantitative and Interpretable Order Parameters for Phase Transitions from Persistent Homology

348   0   0.0 ( 0 )
 نشر من قبل Gregory Loges
 تاريخ النشر 2020
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We apply modern methods in computational topology to the task of discovering and characterizing phase transitions. As illustrations, we apply our method to four two-dimensional lattice spin models: the Ising, square ice, XY, and fully-frustrated XY models. In particular, we use persistent homology, which computes the births and deaths of individual topological features as a coarse-graining scale or sublevel threshold is increased, to summarize multiscale and high-point correlations in a spin configuration. We employ vector representations of this information called persistence images to formulate and perform the statistical task of distinguishing phases. For the models we consider, a simple logistic regression on these images is sufficient to identify the phase transition. Interpretable order parameters are then read from the weights of the regression. This method suffices to identify magnetization, frustration, and vortex-antivortex structure as relevant features for phase transitions in our models. We also define persistence critical exponents and study how they are related to those critical exponents usually considered.

قيم البحث

اقرأ أيضاً

We apply persistent homology to the task of discovering and characterizing phase transitions, using lattice spin models from statistical physics for working examples. Persistence images provide a useful representation of the homological data for cond ucting statistical tasks. To identify the phase transitions, a simple logistic regression on these images is sufficient for the models we consider, and interpretable order parameters are then read from the weights of the regression. Magnetization, frustration and vortex-antivortex structure are identified as relevant features for characterizing phase transitions.
A framework is presented for carrying out simulations of equilibrium systems in the microcanonical ensemble using annealing in an energy ceiling. The framework encompasses an equilibrium version of simulated annealing, population annealing and hybrid algorithms that interpolate between these extremes. These equilibrium, microcanonical annealing algorithms are applied to the thermal first-order transition in the 20-state, two-dimensional Potts model. All of these algorithms are observed to perform well at the first-order transition though for the system sizes studied here, equilibrium simulated annealing is most efficient.
162 - P. Piekarz , K. Parlinski , 2008
The Verwey phase transition in magnetite is analyzed on the basis of the Landau theory. The free energy functional is expanded in a series of components belonging to the primary and secondary order parameters. A low-temperature phase with the monocli nic P2/c symmetry is a result of condensation of two order parameters X_3 and Delta_5 . The temperature dependence of the shear elastic constant C_44 is derived and the mechanism of its softening is discussed.
127 - P. Cats , A. Quelle , O. Viyuela 2017
We find a series of topological phase transitions of increasing order, beyond the more standard second-order phase transition in a one-dimensional topological superconductor. The jumps in the order of the transitions depend on the range of the pairin g interaction, which is parametrized by an algebraic decay with exponent $alpha$. Remarkably, in the limit $alpha = 1$ the order of the topological transition becomes infinite. We compute the critical exponents for the series of higher-order transitions in exact form and find that they fulfill the hyperscaling relation. We also study the critical behaviour at the boundary of the system and discuss potential experimental platforms of magnetic atoms in superconductors.
We introduce Cubical Ripser for computing persistent homology of image and volume data (more precisely, weighted cubical complexes). To our best knowledge, Cubical Ripser is currently the fastest and the most memory-efficient program for computing pe rsistent homology of weighted cubical complexes. We demonstrate our software with an example of image analysis in which persistent homology and convolutional neural networks are successfully combined. Our open-source implementation is available online.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا