Gallery

Most of the following images were produced using Graphviz. You are free to reuse them.

The Erdős-Rényi random graph
The split-and-drift random graph
The Moran forest
A ranked tree-child network

The Erdős-Rényi random graph

First, here is a subcritical Erdős-Rényi random graph, with n = 10000 vertices and p = 0.9 / n.

Now here is a supercritical Erdős-Rényi random graph, with n = 10000 and p = 1.1 / n.

Download: subcritical (png) | subcritical (pdf) | supercritical (png) | supercritical (png)

The split-and-drift random graph

Here are several realizations of the split-and-drift random graph for n 1000 vertices and different values of the parameter r.

split-and-drift random graph, n = 1000 and r = 350

split-and-drift random graph, n = 1000 and r = 100

split-and-drift random graph, n = 1000 and r = 70

split-and-drift random graph, n = 1000 and r = 60

split-and-drift random graph, n = 1000 and r = 50

split-and-drift random graph, n = 1000 and r = 40

split-and-drift random graph, n = 1000 and r = 10

split-and-drift random graph, n = 1000 and r = 5

split-and-drift random graph, n = 1000 and r = 2.5

A ranked tree-child network

A large ranked tree-child network. This image is not the output of a simulation but an "artist impression" drawn in Inkscape.

Download: RTCN (png) | RTCN (pdf)

The Moran forest

Here is a realization of the Moran forest for n = 10000 vertices. The untidy layout of the vertices (for instance compared to that used for the Erdős-Rényi random graph) is only to make the image more aesthetically pleasing.

Download: moran forest (png)

last update: 29/07/2019