Search

We consider a recently introduced generalization of the Ising model in which individual spin strength can vary. The model is intended for analysis of ordering in systems comprising agents which, although matching in their binarity (i.e., maintaining the iconic Ising features of '+' or '−', 'up' or 'down', 'yes' or 'no'), differ in their strength. To investigate the interplay between variable properties of nodes and interactions between them, we study the model on a complex network where both the spin strength and degree distributions are governed by power laws. We show that in the annealed network approximation, thermodynamic functions of the model are self-averaging and we obtain an exact solution for the partition function. This allows us derive the leading temperature and field dependencies of thermodynamic functions, their critical behavior, and logarithmic corrections at the interface of different phases. We find the delicate interplay of the two power laws leads to new universality classes. [ABSTRACT FROM AUTHOR]

The concept of universality is a cornerstone of theories of critical phenomena. It is very well understood in most systems, especially in the thermodynamic limit. Finite-size systems present additional challenges. Even in low dimensions, universality of the edge and corner contributions to free energies and response functions is less investigated and less well understood. In particular, the question arises of how universality is maintained in correction-to-scaling in systems of the same universality class but with very different corner geometries. Two-dimensional geometries deliver the simplest such examples that can be constructed with and without corners. To investigate how the presence and absence of corners manifest universality, we analyze the spanning tree generating function on two different finite systems, namely the cobweb and fan networks. The corner free energies of these configurations have stimulated significant interest precisely because of expectations regarding their universal properties and we address how this can be delivered given that the finite-size cobweb has no corners while the fan has four. To answer, we appeal to the Ivashkevich–Izmailian–Hu approach which unifies the generating functions of distinct networks in terms of a single partition function with twisted boundary conditions. This unified approach shows that the contributions to the individual corner free energies of the fan network sum to zero so that it precisely matches that of the web. It therefore also matches conformal theory (in which the central charge is found to be c = − 2 ) and finite-size scaling predictions. Correspondence in each case with results established by alternative means for both networks verifies the soundness of the Ivashkevich–Izmailian–Hu algorithm. Its broad range of usefulness is demonstrated by its application to hitherto unsolved problems—namely the exact asymptotic expansions of the logarithms of the generating functions and the conformal partition functions for fan and cobweb geometries. We also investigate strip geometries, again confirming the predictions of conformal field theory. Thus, the resolution of a universality puzzle demonstrates the power of the algorithm and opens up new applications in the future. [ABSTRACT FROM AUTHOR]

The complex zeros of the canonical (fixed walk-length) partition function are calculated for both the self-avoiding trails model and the vertex-interacting self-avoiding walk model, both in bulk and in the presence of an attractive surface. The finite-size behavior of the zeros is used to estimate the location of phase transitions: the collapse transition in the bulk and the adsorption transition in the presence of a surface. The bulk and surface cross-over exponents, ϕ and ϕ S , are estimated from the scaling behavior of the leading partition function zeros. [ABSTRACT FROM AUTHOR]