Fig. 4From: Motif-based spectral clustering of weighted directed networksRun time for our two approaches. Top: Erdős-Rényi (ER) graph ensembles. Bottom: Barabási-Albert (BA) graph ensembles. The left panels show very sparse graphs (ER: \(p=\frac {10}{n}\), BA: m=10) and the right panels show less sparse graphs (ER: \(p=\frac {100}{n}\), BA: m=100). We average over five repeats, and error bars are one sample standard deviationBack to article page