The following graph shows the top 50 subgraphs in Wikidata, which form 85% of all Wikidata triples and items. Each node (circle) represents a subgraph and the edges represent connectivity among the subgraphs. This connectivity includes: number of items shared between the subgraphs, number of triples connecting the subgraphs, and number of predicates used in both subgraphs.
Heavier edges mean the two subgraphs overlap a lot in terms of having common items, or are connected by a large number of triples (e.g almost all 'scholarly article' has a 'human' author, therefore connecting the two subgraphs.)
Node sizes, on the oter hand, represent the size of the subgraph. By default it shows the relative size of each subgraph by the number of triples contained in each subgraph. There is also an option to view them in order of rank (this ignores the fact that rank 1 is 50% and rank 2 is 8%, and simply takes the rank numbers 1,2,3...)
Shows size of nodes as per the subgraph rank.
Default graph shows node size as per the subgraph size in terms of number of triples.
Shows only edges that have higher weight
(weight is a combination of number of common items, common predicates, and number of triples connecting the subgraphs).
Instructions:
Zoom in or out to view more.
Drag nodes if required for visibility. The nodes may take time to stabilize into a
neat graph.
Hover over nodes and edges to view more information. Click on nodes or edges to
view the same information in this box.
Checkboxes to the left show different versions of the graph.
It will take some time to update the graph when checked/unchecked.