# The statistical physics of real-world networks

Statistical physics harnesses links between maximum entropy and information theory to capture null model and real-world network features.

*Nature Reviews Physics* 1, 58 (2019)

G. Cimini, T. Squartini, F. Saracco, D. Garlaschelli, A. Gabrielli, G. Caldarelli

In the past 15 years, statistical physics has been successful as a framework for modelling complex networks. On the theoretical side, this approach has unveiled a variety of physical phenomena, such as the emergence of mixed distributions and ensemble non-equivalence, that are observed in heterogeneous networks but not in homogeneous systems. At the same time, thanks to the deep connection between the principle of maximum entropy and information theory, statistical physics has led to the definition of null models for networks that reproduce features of real-world systems but that are otherwise as random as possible. We review here the statistical physics approach and the null models for complex networks, focusing in particular on analytical frameworks that reproduce local network features. We show how these models have been used to detect statistically significant structural patterns in real-world networks and to reconstruct the network structure in cases of incomplete information. We further survey the statistical physics models that reproduce more complex, semilocal network features using Markov chain Monte Carlo sampling, as well as models of generalized network structures, such as multiplex networks, interacting networks and simplicial complexes.

#### More in Structure of how things relate

### From ecology to finance

Bipartite networks model the structures of ecological and economic real-world systems, enabling hypothesis testing and crisis forecasting.

### Clustering inverted

Edge multiplicity—the number of triangles attached to edges—is a powerful analytic tool to understand and generalize network properties.

### Scales in weighted networks

Information theory fixes weighted networks’ degeneracy issues with a generalisation of binary graphs and an optimal scale of link intensities.

### Weighted network evolution

A statistical procedure identifies dominant edges within weighted networks to determine whether a network has reached its steady state.