Searcharxiv⌕ Search

arXiv · cond-mat/0312532

Disorder induced rounding of the phase transition in the large q-state Potts model

Abstract

The phase transition in the q-state Potts model with homogeneous ferromagnetic couplings is strongly first order for large q, while is rounded in the presence of quenched disorder. Here we study this phenomenon on different two-dimensional lattices by using the fact that the partition function of the model is dominated by a single diagram of the high-temperature expansion, which is calculated by an efficient combinatorial optimization algorithm. For a given finite sample with discrete randomness the free energy is a pice-wise linear function of the temperature, which is rounded after averaging, however the discontinuity of the internal energy at the transition point (i.e. the latent heat) stays finite even in the thermodynamic limit. For a continuous disorder, instead, the latent heat vanishes. At the phase transition point the dominant diagram percolates and the total magnetic moment is related to the size of the percolating cluster. Its fractal dimension is found d_f=(5+\sqrt{5})/4 and it is independent of the type of the lattice and the form of disorder. We argue that the critical behavior is exclusively determined by disorder and the corresponding fixed point is the isotropic version of the so called infinite randomness fixed point, which is realized in random quantum spin chains. From this mapping we conjecture the values of the critical exponents as β=2-d_f, β_s=1/2 and ν=1.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. T. Mercaldo, J-Ch. Anglès d'Auriac, F. Iglói. 2004-05-25. Disorder induced rounding of the phase transition in the large q-state Potts model. https://doi.org/10.1103/physreve.69.056112

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Embedding stochastic dynamics in latent manifolds of recurrent neural networks

Recurrent neural networks (RNNs) provide a theoretical framework for understanding computation in biological neural circuits through their ability to support rich time-dependent behaviour. Whilst high-dimensional by construction, they can be used to encode low-dimensional dynamical systems, for example by restricting to low-rank connectivity, hence mirroring the emergence of latent neural manifolds found in empirical neural data. Here, we exploit a relationship between RNNs and a class of universal approximators to train networks that can represent arbitrary, nonlinear stochastic differential equations (SDEs), with given drift and diffusion coefficients, within a low-dimensional latent subspace. We show that RNNs can faithfully embed the drift and diffusion of a given SDE, including nonlinear and nonequilibrium dynamics such as chaotic attractors. We apply this approach by constructing RNN realisations of stochastic systems that transiently explore various attractors through both input-driven switching and autonomous transitions driven by nonequilibrium currents, which we interpret as models of associative and sequential (episodic) memory. To elucidate how these dynamics are encoded in the network, we introduce decompositions of the RNN based on its asymmetric connectivity and its time-irreversibility. Our results show that neural populations can implement a broad class of stochastic dynamics within low-dimensional manifolds, unifying ideas from the dynamics of neural computation, the theory of neural manifolds, associative memory, and nonequilibrium statistical mechanics.

cond-mat.dis-nn↗

Deep-layered machines have a built-in Occam's razor

Many complex systems map vast numbers of microscopic descriptions onto far fewer macroscopic outcomes. Surprisingly, these input-output maps strongly favor simple outputs. In an exactly solvable deep-layered machine, we prove that simplicity bias strengthens with every layer. The probability of an output function $F$ approaches $\Pr(F)\propto 2^{-K(F)}$, where $K$ is the Kolmogorov complexity. Our results show that hierarchical composition alone can generate an intrinsic Occam's razor, suggesting a general mechanism for simplicity bias in learning and evolution.

cond-mat.dis-nn↗

Cup and Cap Topological Neural Network

Topological Deep Learning (TDL) is designed to learn features associated not only with nodes but also with edges, triangles and higher dimensional simplices. However, most TDL approaches, being based on boundary operators and Hodge Laplacians, have the limitation that features and signals cannot be lifted or lowered across more than one dimension per layer. To overcome this limitation, in this work, we propose the adoption of the cup and cap products. Specifically, we formulate the Cup and Cap Topological Neural Network (CCNN), a topological deep learning architecture designed to learn node-based variables (or 0-cochains) by taking into account their many-body interactions (e.g. triangles) present in the data. We validate CCNN by assessing its performance on the TopoBench datasets, demonstrating its competitive performance with respect to other simplicial complex neural networks.

cond-mat.dis-nn↗