Solvable spin model on dynamical networks

We consider an Ising model in which spins are dynamically coupled by links in a network. In this model there are two dynamical quantities which arrange towards a minimum energy state in the canonical framework: the spins, s_i, and the adjacency matrix elements, c_{ij}. The model becomes exactly solvable without recourse to the replica hypothesis or other assumptions because microcanonical partition functions reduce to products of binomial factors as a direct consequence of the c_{ij} s minimizing energy. We solve the system for finite sizes and for the two possible thermodynamic limits and discuss the phase diagrams. The model can be seen as a model for social systems in which agents are not only characterized by their states but also have the freedom to choose their interaction partners in order to maximize their utility.