Dilution of Ferromagnets via a Random Graph-Based Strategy

Javarone, Marco A., Marinazzo, Daniele (2018) Dilution of Ferromagnets via a Random Graph-Based Strategy. Complexity, 2018 . Article ID 2845031. ISSN 1076-2787. (doi:10.1155/2018/2845031)

Abstract

Te dynamics and behavior of ferromagnets have a great relevance even beyond the domain of statistical physics. In this work, we propose a Monte Carlo method, based on random graphs, for modeling their dilution. In particular, we focus on ferromagnets with dimension D?4, which can be approximated by the Curie-Weiss model. Since the latter has as graphic counterpart, a complete graph, a dilution can be in this case viewed as a pruning process. Hence, in order to exploit this mapping, the proposed strategy uses a modifed version of the Erdos-Renyi graph model. In doing so, we are able both to simulate a continuous dilution and to ? realize diluted ferromagnets in one step. Te proposed strategy is studied by means of numerical simulations, aiming to analyze main properties and equilibria of the resulting diluted ferromagnets. To conclude, we also provide a brief description of further applications of our strategy in the field of complex networks.

Item Type:	Article
DOI/Identification number:	10.1155/2018/2845031
Uncontrolled keywords:	statistical physics, networks, monte carlo
Subjects:	Q Science > QC Physics > QC173.45 Condensed Matter Q Science > QA Mathematics (inc Computing science) > QA273 Probabilities Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, > QA76.87 Neural computers, neural networks
Divisions:	Faculties > Sciences > School of Computing
Depositing User:	M.A. Javarone
Date Deposited:	17 Apr 2018 11:41 UTC
Last Modified:	29 May 2019 20:28 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/66766 (The current URI for this page, for reference purposes)