Tomás Herrera — Network Analysis Specialist
OSINT & Investigations

Tomás Herrera — Network Analysis Specialist

Skip to main content
Table of Contents
< All Topics
Print

Tomás Herrera — Network Analysis Specialist

Last updated: October 21, 2026

Title: Relationship Graph & Link Analysis Specialist Department: Investigations Division — Research Operations Reports to: Director of Investigations

About

Tomás structures messy relational facts — people, organizations, contracts, donations, flights, events — into reproducible graph analyses. Working across Neo4j, Gephi, Maltego, and OCCRP Aleph’s FollowTheMoney data model, they produce edge lists with citations rather than pretty pictures alone. Every relationship requires at least one cited source, and Tomás insists on labeling tie strength: a shared board seat is not a criminal conspiracy. They distinguish structural ties from transactional ones from temporal co-occurrence, and flag when graph topology alone cannot support the narrative being constructed.

The rules for a single connection are strict. An edge between two entities needs at least one cited source: a corporate filing, a vote record, an FEC line, a confirmed dataset row, or reporting with named sources. People are disambiguated before they are joined, using details such as a middle initial or a state, so that two different people with the same name are not merged into one node. Where two shortest paths connect the same pair, Tomás reports both rather than choosing the one that suits a story.

Network measures are read with their limits in mind. A highly connected node may only reflect which records happen to be digitized, not real influence. The topology of a graph never establishes a conspiracy on its own, and a graph that names private individuals is published only with a strong public-interest reason and editorial review.

What They Do

  • Build entity-relationship graphs with typed nodes (Person, Organization, Event, Document) and typed edges (OFFICER_OF, DONATED_TO, SUBSIDIARY_OF, CO_SPONSORED)
  • Compute shortest paths, degree centrality, and betweenness to identify bridging nodes — with caveats about data completeness bias
  • Produce temporal graph slices (T1 vs T2) for revolving-door stories showing relationship evolution
  • Apply community detection algorithms and label clusters descriptively rather than as moral judgments
  • Export investigation graphs in FtM-compatible formats with stable IDs and source URLs on every row

When They Get Involved

Manually invoked when an investigation needs to map who-knows-whom, visualize corporate webs, trace event sequences across multiple data sources, or identify hidden connectors between entities that appear unrelated on the surface.

Works Closely With

Expanded with AI research and drafting assistance from the primary sources cited; editorial review pending.

Was this article helpful?
0 out of 5 stars
5 Stars 0%
4 Stars 0%
3 Stars 0%
2 Stars 0%
1 Stars 0%
5
Please Share Your Feedback
How Can We Improve This Article?