Fig. 7
From: Non-backtracking cycles: length spectrum theory and graph mining applications
Values of r0 for random (top) and real (bottom) data sets. r0 is the number of eigenvalues whose magnitude is greater than \(\sqrt {\lambda _{1}}\), where λ1 is the largest eigenvalue in magnitude, which is always guaranteed to be positive and real. We use r0 eigenvalues from each network when comparing them. This usually yields different numbers of eigenvalues per network