Abstract

The representation of complex lattice models in the form of a tensor network is a promising approach to the analysis of the thermodynamics of such systems. Once the tensor network is built, various methods can be used to calculate the partition function of the corresponding model. However, it is possible to build the initial tensor network in different ways for the same model. In this work, we have proposed two ways of constructing tensor networks and demonstrated that the construction process affects the accuracy of calculations. For demonstration purposes, we have done a brief study of the 4 nearest-neighbor (NN) and 5NN models, where adsorbed particles exclude all sites up to the fourth and fifth nearest neighbors from being occupied by another particle. In addition, we have studied a 4NN model with finite repulsions with a fifth neighbor. In a sense, this model is intermediate between 4NN and 5NN models, so algorithms designed for systems with hard-core interactions may experience difficulties. We have obtained adsorption isotherms, as well as graphs of entropy and heat capacity for all models. The critical values of the chemical potential were determined from the position of the heat capacity peaks. As a result, we were able to improve our previous estimate of the position of the phase transition points for the 4NN and 5NN models. And in the model with finite interactions, we found the presence of two first-order phase transitions and made an estimate of the critical values of the chemical potential for them.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.