Skip to main content
. 2017 Dec 11;34(9):1514–1521. doi: 10.1093/bioinformatics/btx798

Fig. 6.

Fig. 6.

An example ESG for degree sequence R=C={2,1,1,2,1,1}. (A) The 0-1 matrix of the initial graph. (B) ESG corresponding to this degree sequence (dots represent graphs in sample space) with detected clusters outlined. (C–F) Cluster-time diagrams for each examined algorithm; nodes represent clusters in the ESG with node size indicating the fraction of times a given algorithm sampled graphs in that cluster