Dynamics of one-dimensional spin models under the line-graph operator

Abstract

We investigate the application of the line-graph operator to one-dimensional spin models with periodic boundary conditions. The spins (or interactions) in the original spin structure become the interactions (or spins) in the resulting spin structure. We identify conditions which ensure that each new spin structure is stable, that is, its spin configuration minimises its internal energy. Then, making a correspondence between spin configurations and binary sequences, we propose a model of information growth and evolution based on the line-graph operator. Since this operator can generate frustrations in newly formed spin chains, in the proposed model such frustrations are immediately removed. Also, in some cases, the previously frustrated chains are allowed to recombine into new stable chains. As a result, we obtain a population of spin chains whose dynamics is studied using Monte Carlo simulations. Lastly, we discuss potential applications to areas of research such as combinatorics and theoretical biology.

arXiv comment28 pages, 12 figures

References in corpus (14)

• Statistical physics of social dynamics
• Sociophysics: A review of Galam models
• Life is physics: evolution as a collective phenomenon far from equilibrium
• Evolutionary mixed games in structured populations: Cooperation and the benefits of heterogeneity
• Ising model versus normal form game
• From Dyson to Hopfield: Processing on hierarchical networks
• How glassy are neural networks?
• Fragile topology in line-graph lattices with two, three, or four gapped flat bands
• Thermodynamic costs of Turing Machines
• Annealing and replica-symmetry in Deep Boltzmann Machines
• Properties of Quantum Graphity at Low Temperature
• Invasion controlled pattern formation in a generalized multi-species predator-prey system
• Social dilemmas in off-lattice populations
• On the Degeneracy of Spin Ice Graphs, and its Estimate via the Bethe Permanent