Ising Ferromagnets on Proximity Graphs with Varying Disorder of the Node Placement

Abstract

Abstract We perform Monte Carlo simulations to determine the critical temperatures of Ising Ferromagnets (IFM) on different types of two-dimensional proximity graphs, in which the distribution of their underlying node sets has been changed systematically by means of a parameter σ. This allows us to interpolate between regular grids and proximity graphs based on complete random placement of nodes. Each edge of the planar proximity graphs carries a weighted ferromagnetic coupling. The coupling strengths are determined via the Euclidean distances between coupled spins. The simulations are carried out on graphs with N = 162 to N = 1282 nodes utilising the Wolff cluster algorithm and parallel tempering method in a wide temperature range around the critical point to measure the Binder cumulant in order to obtain the critical temperature for different values of σ. Interestingly, the critical temperatures depend partially non-monotonously on the disorder parameter σ, corresponding to a non-monotonous change of the graph structure. For completeness, we further verify using finite-size scaling methods that the IFM on proximity graphs is for all values of the disorder in the same universality class as the IFM on the two-dimensional square lattice.