SIX DEGREES
CONNECTION FINDER 316 EDGES NETWORK PATH ANALYSIS DATA AS OF 2026-02-23Find the shortest connection path between any two persons in the Epstein network. Paths are computed via BFS across 208 co-flight relationship edges, where an edge exists when two persons shared at least one documented flight. Maximum search depth: 6 degrees.
PATH SEARCH PARAMETERS
// SELECT TWO PERSONS AND CLICK FIND PATH TO BEGIN ANALYSIS
Path Length
--
Shared Flights
Avg Edge Weight
--
Paths Found
--
Min Degree
--
NO CONNECTION FOUND WITHIN 6 DEGREES
These persons do not share a documented co-flight relationship chain within the maximum search depth.
ALTERNATE PATHS
METHODOLOGY
208
Relationship Edges
Co-flight relationship graph derived from 1,708 documented flight records. An edge (connection) exists between two persons when they share at least one flight manifest.
BFS
Search Algorithm
Breadth-First Search finds the shortest path guaranteed. All Paths mode uses depth-limited DFS to enumerate up to 10 alternate routes through the network.
6
Max Degrees
Search depth capped at six degrees per the Six Degrees of Separation hypothesis. Edge weight reflects the number of shared co-flight records between any two persons.