Skip to main content
. Author manuscript; available in PMC: 2024 Apr 11.
Published in final edited form as: Nature. 2021 Mar 3;591(7848):54–60. doi: 10.1038/s41586-021-03202-1

Fig. 6 |. Graph similarity experiment.

Fig. 6 |

Feature vectors corresponding to four different graphs, which are drawn next to their corresponding feature vectors. Negative-weighted edges are highlighted by thick red lines. The components of the vectors are probabilities for the orbits [1,1,1], [1,1,1,1] and [2,1,1,1], respectively. Feature vectors are also calculated for three random permutations of the graph. These appear as clusters of permutationally invariant graphs.