Our papers are the official record of our discoveries. They allow others to build on and apply our work. Each paper is the result of many months of research, so we make a special effort to make them clear, beautiful and inspirational, and publish them in leading journals.

### Exactly solvable random graphs

An explicit analytical solution reproduces the main features of random graph ensembles with many short cycles under strict degree constraints.

### Erdős-Ko-Rado theorem analogue

A random analogue of the Erdős-Ko-Rado theorem sheds light on its stability in an area of parameter space which has not yet been explored.

### Random graphs with short loops

The analysis of real networks which contain many short loops requires novel methods, because they break the assumptions of tree-like models.

### Entropies of graph ensembles

Explicit formulae for the Shannon entropies of random graph ensembles provide measures to compare and reproduce their topological features.

### The temperature of networks

A new concept, graph temperature, enables the prediction of distinct topological properties of real-world networks simultaneously.

### Bootstrapping topology and risk

Information about 10% of the links in a complex network is sufficient to reconstruct its main features and resilience with the fitness model.

### Weighted network evolution

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

### What you see is not what you get

Methods from tailored random graph theory reveal the relation between true biological networks and the often-biased samples taken from them.