A COMPLEX NETWORK GRAPH
SIMPLY
Larger nodes have more entries. Larger connections have more intra-document mentions. Values are shown logarithmically, meaning large nodes or bold connections have EXPONENTIALLY more datapoints.
Nodes closer to the center have more intra-document connections, meaning they are mentioned in correlation with a wide array of other key nodes. This can usually be interpreted as central nodes being more central to Epstein's circle.
The presence of a person, place, or topic doesn't explicitly imply involvement with Epstein. Nodes that are discussed often without notable allegations also appear here.
PDF Files
Datapoints
Connections
Displayed Nodes
All files were downloaded from the DOJ website following the public data released related to the Epstein Files Transparency Act.
AI analysis (Claude) was performed on a sample of the files to determine key search terms. Terms were monitored and cleaned until a tight margin of error was met.
A Python script searched each file individually to find intra-document connections — any single page that mentions two or more keywords simultaneously.
The network was visualized using NetworkX and PyVis, two Python libraries specialized in graph theory and interactive network visualization.