IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v626y2023ics0378437123006453.html
   My bibliography  Save this article

An Ising model having permutation spin motivated by a permutation complexity measure

Author

Listed:
  • Dukes, Mark

Abstract

In this paper we define a variant of the Ising model in which spins are replaced with permutations. The energy between two spins is a function of the relative disorder of one spin, a permutation, to the other. This model is motivated by a complexity measure for declarative systems. For such systems a state is a permutation and the permutation sorting complexity measures the average sequential disorder of neighbouring states. To measure the relative disorder between two spins we use a symmetrized version of the descent permutation statistic that has appeared in the works of Chatterjee & Diaconis and Petersen. The classical Ising model corresponds to the length-2 permutation case of this new model. We consider and prove some elementary properties for the 1D case of this model in which spins are length-3 permutations.

Suggested Citation

  • Dukes, Mark, 2023. "An Ising model having permutation spin motivated by a permutation complexity measure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    • Handle: RePEc:eee:phsmap:v:626:y:2023:i:c:s0378437123006453
    DOI: 10.1016/j.physa.2023.129090
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437123006453
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2023.129090?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sourav Chatterjee & Persi Diaconis, 2017. "A central limit theorem for a new statistic on permutations," Indian Journal of Pure and Applied Mathematics, Springer, vol. 48(4), pages 561-573, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:626:y:2023:i:c:s0378437123006453. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.