Skip to main content


Fig. 11 | Applied Network Science

Fig. 11

From: Non-backtracking cycles: length spectrum theory and graph mining applications

Fig. 11

NBD in the presence of noise. For each graph AS331, P2P09, facebook, HepPh we compute 10 rewired versions using degree-preserving randomization, for increasing percentage of edges rewired. We show the average NBD between the original graph and the rewired versions; shaded regions indicate standard deviation. As expected, NBD is an increasing function the percentage of rewired edges. This implies that NBD is detecting graph structural features that are not determined by degree distribution

Back to article page