Network graph showing ties between Pages based on mutual domain shares; the graph is filtered by Giant Component, so every node has a path to all other nodes and with a K-Core of 2; node size is determined by out-degree, and node colors are communities as detected by Louvain Modularity. 13

Select target paragraph3