Statistical mechanics of topological phase transitions in networks

Abstract

We provide a phenomenological theory for topological transitions in restructuring networks. In this statistical mechanical approach energy is assigned to the different network topologies and temperature is used as a quantity referring to the level of noise during the rewiring of the edges. The associated microscopic dynamics satisfies the detailed balance condition and is equivalent to a lattice gas model on the edge-dual graph of a fully connected network. In our studies -- based on an exact enumeration method, Monte-Carlo simulations, and theoretical considerations -- we find a rich variety of topological phase transitions when the temperature is varied. These transitions signal singular changes in the essential features of the global structure of the network. Depending on the energy function chosen, the observed transitions can be best monitored using the order parameters Phi_s=s_{max}/M, i.e., the size of the largest connected component divided by the number of edges, or Phi_k=k_{max}/M, the largest degree in the network divided by the number of edges. If, for example the energy is chosen to be E=-s_{max}, the observed transition is analogous to the percolation phase transition of random graphs. For this choice of the energy, the phase-diagram in the [<k>,T] plane is constructed. Single vertex energies of the form E=sum_i f(k_i), where k_i is the degree of vertex i, are also studied. Depending on the form of f(k_i), first order and continuous phase transitions can be observed. In case of f(k_i)=-(k_i+c)ln(k_i), the transition is continuous, and at the critical temperature scale-free graphs can be recovered.