What graph enrichment is
Your first-party identity graph reflects the linkages you can directly observe: login events, CRM matches, transaction data. But your observation is limited to your own touchpoints. Graph enrichment fills the gaps by incorporating linkages observed by third-party providers across their own data ecosystems. The result is a more connected graph with fewer fragmented profiles and better person-level or household-level resolution.How it works
Consider a retail company with this first-party data:- Customer A: hashed email + iPhone IDFA (observed via app login)
- Customer A: hashed email + home address (observed via shipping)
- Customer A’s component now includes five nodes: personal email, work email, IDFA, GAID, and home address
- The retailer can now reach Customer A on Android devices and recognize them when they use their work email
Effects on the graph
Graph enrichment can improve your identity graph in several ways: Person-level resolution. Connecting identifiers that belong to the same individual across devices and channels. A customer who appears as three separate profiles (email-only, MAID-only, cookie-only) becomes one resolved profile. Household-level resolution. Linking identifiers across individuals within a household. Shared addresses, shared IP ranges, and shared device usage can connect household members when that level of resolution is appropriate for your use case. Waterfall matching flexibility. A richer graph gives you more identifiers per person, which means more opportunities to match against any given activation platform. If one identifier type fails to match, another may succeed. Longitudinal consistency. When identifiers change over time (cookies expire, MAIDs reset), a well-enriched graph maintains continuity through other persistent linkages.What to look for in providers
When evaluating graph enrichment providers, focus on these criteria:| Criterion | What to measure | Why it matters |
|---|---|---|
| Linkage depth | Average edges per node | More edges per node means richer resolution |
| Determinism rate | Percentage of deterministic vs. probabilistic linkages | Deterministic linkages are more reliable |
| Confidence score quality | Distribution and calibration of confidence scores | Well-calibrated scores enable meaningful thresholds |
| Update cadence | How frequently linkages are refreshed | Stale linkages degrade graph quality over time |
| Incremental component overlap | How many of your existing components gain new edges | Measures actual incremental value vs. redundant coverage |
Risks
Graph enrichment carries higher stakes than addressability expansion. A bad identifier append reduces match rates—an inconvenience. A bad linkage merges two distinct people into a single profile—a structural corruption that propagates through every downstream use case. Protect against this by:- Setting confidence thresholds. Only incorporate linkages above a minimum confidence score. Start conservative and relax over time as you validate quality.
- Monitoring component size distribution. A sudden increase in very large components may indicate over-linking. Healthy graphs follow a predictable size distribution.
- Evaluating incrementally. Test a provider’s linkages against a subset of your graph before full integration. Measure resolution improvement against a known truth set.

