Skip to main content
Fig. 8 | Applied Network Science

Fig. 8

From: Analysing the sensitivity of nestedness detection methods

Fig. 8

Sensitivity analysis among NESTLON, BINMATNEST, and NODF on a benchmark graph with an increasing fraction of rewired edges ρ rew . The values of nestedness are almost independent from the shape of the adjacency matrix for the method NESTLON. The variance in nestedness is larger for BINMANEST and NODF compared to NESTLON for differing matrix shapes, n a /n b ={1,1.2,1.5,2,5,10}. The variance in nestedness against ρ rew increases for the method BINMATNEST, whereas it decreases for the method NODF. We therefore judge NESTLON as least sensitive in detecting nestedness on bipartite graphs for a broad range of different matrix shapes. We perform the computation on a bipartite benchmark graph with α=0.49 and a set size of n b =100 and increasing n a

Back to article page