We give an intuitive geometric explanation for the apparent breakdown of standard finite-size scaling in systems with periodic boundaries above the upper critical dimension. The Ising model and self-avoiding walk are simulated on five-dimensional hypercubic lattices with free and periodic boundary conditions, by using geometric representations and recently introduced Markov-chain Monte Carlo algorithms. We show that previously observed anomalous behaviour for correlation functions, measured on the standard Euclidean scale, can be removed by defining correlation functions on a scale which correctly accounts for windings.Finite-size Scaling (FSS) is a fundamental physical theory within statistical mechanics, describing the asymptotic approach to the thermodynamic limit of finite systems in the neighbourhood of a critical phase transi-It is well-known [3] that models of critical phenomena typically possess an upper critical dimension, d c , such that in dimensions d ≥ d c , their thermodynamic behaviour is governed by critical exponents taking simple mean-field values [4]. In contrast to the simplicity of the thermodynamic behaviour, however, the theory of FSS in dimensions above d c is surprisingly subtle, and remains the subject of ongoing debate [5][6][7][8][9][10][11][12]. We will show here that such subtleties can be explained in a simple way, by taking an appropriate geometric perspective.Perhaps the most important class of models in equilibrium statistical mechanics are the n-vector models [13], describing systems of pairwise-interacting unit-vector spins in R n [14]. The cases n = 1, 2, 3 respectively correspond to the Ising, XY and Heisenberg models of ferromagnetism, while the limiting case n = 0 corresponds to the Self-avoiding Walk (SAW) model of polymers [3].The n-vector model has wide-ranging applications in condensed matter physics, particularly in the theory of superfluidity/superconductivity and quantum magnetism. In addition, the case n = 2 is related to the Bose-Hubbard model [15] which is actively studied in the field of ultra-cold atom physics. In such quantum applications, the quantum system in d spatial dimensions is related to the classical model in d + 1 dimensions. Since [3] d c = 4 for the nearest-neighbour n-vector model, this shows that understanding its FSS when d ≥ d c is of importance not only to the theory of FSS itself, but also in the field of condensed matter physics more generally. We also note that the value of d c can be reduced by the introduction of long-range interactions.
The simulation of spin models close to critical points of continuous phase transitions is heavily impeded by the occurrence of critical slowing down. A number of cluster algorithms, usually based on the Fortuin-Kasteleyn representation of the Potts model, and suitable generalizations for continuousspin models have been used to increase simulation efficiency. The first algorithm making use of this representation, suggested by Sweeny in 1983, has not found widespread adoption due to problems in its implementation. However, it has been recently shown that it is indeed more efficient in reducing critical slowing down than the more well-known algorithm due to Swendsen and Wang. Here, we present an efficient implementation of Sweeny's approach for the random-cluster model using recent algorithmic advances in dynamic connectivity algorithms.
Original citation:Kovacs, Istvan A., Elci, Eren Metin., Weigel, Martin., and Igloi, Ferenc Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders. For the two-dimensional Q-state Potts model at criticality, we consider Fortuin-Kasteleyn and spin clusters and study the average number N of clusters that intersect a given contour . To leading order, N is proportional to the length of the curve. Additionally, however, there occur logarithmic contributions related to the corners of . These are found to be universal and their size can be calculated employing techniques from conformal field theory. For the Fortuin-Kasteleyn clusters relevant to the thermal phase transition, we find agreement with these predictions from large-scale numerical simulations. For the spin clusters, on the other hand, the cluster numbers are not found to be consistent with the values obtained by analytic continuation, as conventionally assumed. CURVE is the Institutional Repository for Coventry University
We design an irreversible worm algorithm for the zero-field ferromagnetic Ising model by using the lifting technique. We study the dynamic critical behavior of an energylike observable on both the complete graph and toroidal grids, and compare our findings with reversible algorithms such as the Prokof'ev-Svistunov worm algorithm. Our results show that the lifted worm algorithm improves the dynamic exponent of the energylike observable on the complete graph and leads to a significant constant improvement on toroidal grids.
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By introducing a classification of edges based on their relevance to the connectivity we study the stability of clusters in this model. We derive several exact relations for general graphs that allow us to derive unambiguously the finite-size scaling behavior of the density of bridges and non-bridges. For percolation, we are also able to characterize the point for which clusters become maximally fragile and show that it is connected to the concept of the bridge load. Combining our exact treatment with further results from conformal field theory, we uncover a surprising behavior of the variance of the number of (non-)bridges, showing that these diverge in two dimensions below the value $4\cos^2{(\pi/\sqrt{3})}=0.2315891\cdots$ of the cluster coupling $q$. Finally, it is shown that a partial or complete pruning of bridges from clusters enables estimates of the backbone fractal dimension that are much less encumbered by finite-size corrections than more conventional approaches.Comment: final version as publishe
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.