Skip to main content
Fig. 3 | Applied Network Science

Fig. 3

From: Analysing the sensitivity of nestedness detection methods

Fig. 3

Robustness analysis for detecting the nested component among BINMATNEST, NODF and NESTLON on a benchmark graph. By definition all realisations of the benchmark graph are nested for all values of α. We perform the computation on a graph of size n=100,200,300. The graph density (i.e. γ d ) increases with α, whereas the density of violations (i.e. γ v ) remains around zero

Back to article page
\