Sets & relationships / Network graph
Your data stays in your browser: files are read and processed on your device, never uploaded to any server, and cleared when you close the page. Free, no sign-in.
Dots are nodes and lines are edges; node size follows degree (number of edges) by default, line width follows |weight|, and negative edges are blue. The force-directed layout pulls tightly connected nodes together; drag nodes to adjust.
Nodes are coloured by Louvain community by default: communities have many more internal links than expected by chance, and a higher modularity Q (typically > 0.3) indicates clearer community structure.
Directed networks are drawn with arrows and the node table adds in- and out-degree; communities are always computed on the undirected graph with |weight|.
With many edges the picture becomes a hairball: filter weak edges with the |weight| threshold first (for example |r| ≥ 0.6) or limit the number of edges. Node and edge tables can be downloaded for further analysis.
Communities: the Louvain method (Blondel V. D. et al. 2008, J Stat Mech P10008), visiting nodes in input order so results are deterministic; modularity Q (Newman 2006, PNAS 103:8577–8582). Layout: Fruchterman–Reingold force-directed (fixed seed).
Up to 5,000 edges and 3,000 nodes drawn.
Send us your data and research question and you will receive a written plan within 1 working day: analysis steps, parameter rationale, deliverables and timeline. Quoted per project.