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

被引:0
|
作者
Dukes, Mark [1 ]
机构
[1] Univ Coll Dublin, Sch Math & Stat, Dublin, Ireland
关键词
Ising model; Permutation entropy; Permutation complexity; Declarative process; Permutation spin; Combinatorial physics;
D O I
10.1016/j.physa.2023.129090
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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. (c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:12
相关论文
共 50 条
  • [31] Weighted-permutation entropy: A complexity measure for time series incorporating amplitude information
    Fadlallah, Bilal
    Chen, Badong
    Keil, Andreas
    Principe, Jose
    PHYSICAL REVIEW E, 2013, 87 (02):
  • [32] Permutation Complexity Related to the Letter Doubling Map
    Widmer, Steven
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 265 - 276
  • [33] THE COMPUTATIONAL-COMPLEXITY OF RECOGNIZING PERMUTATION FUNCTIONS
    MA, KJ
    VONZURGATHEN, J
    COMPUTATIONAL COMPLEXITY, 1995, 5 (01) : 76 - 97
  • [34] The complexity of the weight problem for permutation and matrix groups
    Cameron, Peter J.
    Wu, Taoyang
    DISCRETE MATHEMATICS, 2010, 310 (03) : 408 - 416
  • [35] The Graphical Complexity of Direct Products of Permutation Groups
    Grech, Mariusz
    JOURNAL OF GRAPH THEORY, 2011, 66 (04) : 303 - 318
  • [36] THE PARALLEL COMPLEXITY OF ABELIAN PERMUTATION GROUP PROBLEMS
    MCKENZIE, P
    COOK, SA
    SIAM JOURNAL ON COMPUTING, 1987, 16 (05) : 880 - 909
  • [37] On the permutation complexity of the Cantor-like sequences
    Lu, Xiao-Tao
    Chen, Jin
    Guo, Ying-Jun
    Wen, Zhi-Xiong
    THEORETICAL COMPUTER SCIENCE, 2016, 616 : 100 - 110
  • [38] On the Accepting State Complexity of Operations on Permutation Automata
    Rauch, Christian
    Holzer, Markus
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2022, (367): : 177 - 189
  • [39] ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
    Gill, Nick
    Loda, Bianca
    Spiga, Pablo
    NAGOYA MATHEMATICAL JOURNAL, 2022, 246 : 372 - 411
  • [40] Permutation complexity and dependence measures of time series
    Zhao, Xiaojun
    Shang, Pengjian
    Huang, Jingjing
    EPL, 2013, 102 (04)