Skip to main content

Advertisement

Fig. 12 | Applied Network Science

Fig. 12

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

Fig. 12

NBED of example random graphs. We select one graph from each of our random data sets with n=5,000 nodes and show its 2-dimensional NBED. Each dot corresponds to a directed edge; color corresponds to the degree of the target node. We are able to detect patterns, such as small sets of points that are separate from the rest (red circles), and boundaries that determine the regions of the plane where the points lie (gray dashed lines). See “Visualization” section for discussion and interpretation

Back to article page