A phase transition creates the geometry of the continuum from discrete space, but it needs disorder if it is to have the right metric.
One-shot analogs of fluctuation-theorem results help unify these two approaches for small-scale, nonequilibrium statistical physics.
The challenge of statistical reconstruction is using the limited available information to predict stock holdings.
A new algorithm unveils complicated structures in the bipartite mapping between countries and products of the international trade network.
The spectral density of graph ensembles provides an exact solution to the graph partitioning problem and helps detect community structure.
Exact equations of motion provide an analytical description of the evolution and relaxation properties of complex memristive circuits.
A general analysis of exchange devices links their efficiency to the geometry of the exchange surface and supply network.
An extension of the Kelly criterion maximises the growth rate of multiplicative stochastic processes when limited resources are available.
A new tool derived from information theory quantitatively identifies trees, hierarchies and community structures within complex networks.
Fractal structures need very little mass to support a load; but for current designs, this makes them vulnerable to manufacturing errors.
We show that self-similar fractal structures exhibit new strength-to-mass scaling relations, offering unprecedented mechanical efficiency.
A statistical procedure identifies dominant edges within weighted networks to determine whether a network has reached its steady state.
Unbiased randomisation processes generate sophisticated synthetic networks for modelling and testing the properties of real-world networks.
The information needed to self-assemble a structure quantifies its modularity and explains the prevalence of certain structures over others.