graph-the-network
Build an entity-relationship link-analysis graph of an investigation — nodes, typed edges carrying source and confidence, aliases, and temporal validity — to expose shared infrastructure, bridging nodes and the real principal behind a frontman. Covers Maltego, Neo4j and Cypher, Gephi, centrality and community detection, and entity resolution. Use when an investigation has outgrown a list and needs a graph, or when asked how a set of people, companies and domains connect. Applies to fraud-ring and shell-network detection, AML and sanctions-evasion analysis, and complex corporate-structure work. Reference at useosint.com/skills/graph-the-network.
UseOSINT · 已有静态检查记录
安装与使用
运行命令前先阅读来源与依赖说明。复制命令不会自动安装或执行。
npx skills add UseOSINT/Skills --skill graph-the-network技能说明
name: graph-the-network description: >- Build an entity-relationship link-analysis graph of an investigation — nodes, typed edges carrying source and confidence, aliases, and temporal validity — to expose shared infrastructure, bridging nodes and the real principal behind a frontman. Covers Maltego, Neo4j and Cypher, Gephi, centrality and community detection, and entity resolution. Use when an investigation has outgrown a list and needs a graph, or when asked how a set of people, companies and domains connect. Applies to fraud-ring and shell-network detection, AML and sanctions-evasion analysis, and complex corporate-structure work. Reference at useosint.com/skills/graph-the-network.
Graph the network
A list of thirty selectors and a graph of thirty selectors contain identical information, and only one of them lets you see that two clusters share a node. That is the entire justification: humans do not detect shared elements across rows, and detect them instantly in a layout. The beginner mistake is treating the graph as an output — a picture drawn at the end for the report. It is the case's working memory, built from the first pivot, and the report is generated from it.
Decide the schema before the second node
Everything useful downstream — deduplication, centrality, querying, the report table — depends on decisions made in the first ten minutes. Two rules:
One node per real-world thing. An alias is an attribute, not a node. If "J. Okonkwo", "jokonkwo", and "Joseph Okonkwo" are three nodes, every metric you compute is wrong: degree is split three ways, so the most important person in the case looks peripheral, and the shared connection between two clusters never appears because it is distributed across duplicates. Merge on evidence and record the merge (which selectors, what confidence) — an unrecorded merge is an unauditable assertion that two things are one thing.
The exception that trips people: a person and their account are different
things. Model Person —operates→ Account, because the operator can change and
the account can be shared. Collapsing them makes both facts unrepresentable.
A closed set of edge types. Free-text edge labels produce owns,
owned-by, ownership, and is owner of in one graph, and no query ever finds
them all. Fix the vocabulary, keep it small, keep direction consistent, and
write it at the top of the case file. Starter schema with entity types, edge
types, required attributes, and the alias/merge convention:
reference/schema-starter.md.
Source and confidence go on the edge
This is the practice that separates a useful graph from a pretty one, and it is the one most often skipped.
Node provenance is almost never the issue. The claim is in the relationship:
"this person controls this company", "this domain is operated by this actor".
Every edge therefore carries at minimum: source (URL, tool, or exhibit ID),
retrieval timestamp, source grade (see investigate-anything), and confidence.
Without it, an edge asserted by a registry filing and an edge inferred from two
accounts posting similar text render identically — and once drawn, a weak link
is indistinguishable from a strong one and gets reasoned over as fact.
Render confidence visually: solid for confirmed, dashed for probable, dotted for
unconfirmed. Then look at your graph and notice how much of the structure you
were relying on is dotted. Keep a confirmed-only view and check whether your
conclusion survives it — if it collapses, your finding is an artefact of your
weakest edges.
Add temporal validity — valid_from / valid_to — to any edge that can end:
employment, domain registration, address, directorship, IP resolution. A graph
without time silently asserts that everything coexisted, which manufactures
relationships between people who never overlapped. Two directors of one company
five years apart are not connected; an untimed graph says they are.
What the graph actually gives you
- Shared infrastructure. One registrant email, one analytics or ad
identifier, one TLS certificate, one reused avatar hash joining sites that
present as unrelated. Feed
who-owns-this-domain,find-hidden-subdomains, andfind-exposed-serversinto the graph and these appear as high-degree nodes without you looking for them. - Bridges. A node whose removal splits the graph into disconnected components. In practice this is the person or asset linking two personas or two networks, and it is usually the finding. Formally it is high betweenness centrality; visually it is the node in the gap between two blobs.
- Degree versus betweenness. The highest-degree node is often the most visible party — the public director, the frontman, or a shared service. The controlling party frequently sits at moderate degree and high betweenness: few connections, but the ones that matter. Compute both and compare; where they disagree, look hard at the difference.
- Communities. Modularity/community detection partitions the graph into clusters. Useful mainly to find the nodes that sit in the wrong cluster.
- Gaps. A node with one edge in a dense neighbourhood is a collection gap, not a fact about the world. Let the sparse regions drive the next pivot.
Treat centrality as a pointer to where to look, never as a conclusion. It measures your collection as much as reality: whatever you enumerated most thoroughly becomes the centre of the graph.
Tools
| Situation | Reach for |
|---|---|
| Fewer than ~200 nodes, one analyst, needs to end up in a report | Node and edge tables in a spreadsheet or CSV, rendered with Graphviz or imported to Gephi |
| Query-driven work: paths, shared attributes, "who connects A and B" | Neo4j with Cypher |
| Layout, metrics, community detection, presentation | Gephi |
| Automated pivoting from a node, and you have the licensing | Maltego |
Honest default: for most investig
阅读完整来源 ↗