The Phenomenon

After building a knowledge graph with GraphRAG, you query a community node and discover it has no PARENT_OF relationships — neither a parent nor any children. Yet the graph clearly contains many PARENT_OF edges. Why was this community "forgotten"?

Background: GraphRAG's Hierarchical Community Structure

GraphRAG uses the Leiden algorithm to perform hierarchical clustering on the entity graph. To make this intuitive, let's use a "world map" analogy to explain the entire process.

Imagine You're Grouping Everyone in the World

Suppose you have a massive social network graph where each node is a person and edges represent "these two people are connected." Now you need to group them:

1. Level 0 (coarsest granularity): First divide by the largest circles — equivalent to splitting everyone into "continents." People within the same continent are closely connected; connections between continents are sparse.
2. Level 1: Further divide within each continent — equivalent to splitting into "countries."
3. Level 2: Divide within each country — equivalent to "provinces/states."
4. Level 3, 4, ...: Continue dividing into "cities," "neighborhoods"...

The higher the level, the finer the granularity.

Each layer connects to the next through PARENT_OF edges (coarse → fine):

Continent ──PARENT_OF──> Country ──PARENT_OF──> Province ──PARENT_OF──> City
(level 0)              (level 1)             (level 2)              (level 3)

A Complete Example

Suppose we run GraphRAG hierarchical clustering on a "Global Cuisine Knowledge Graph." The entities are various ingredients, dishes, and cooking techniques, with edges representing their associations.

First Round of Clustering (Level 0): 5 Major Groups

Second Round of Clustering (Level 1): Subdividing Within Groups

Continent A "Asian Cuisine" (800 entities) has complex internal structure and can be further divided:

Continent A "Asian Cuisine" (level 0, size=800)
  ├── PARENT_OF → Country A1 "Chinese Cuisine" (level 1, size=300)
  │     ├── PARENT_OF → Province A1a "Sichuan Cuisine" (level 2, size=80)
  │     ├── PARENT_OF → Province A1b "Cantonese Cuisine" (level 2, size=70)
  │     └── PARENT_OF → Province A1c "Shandong Cuisine" (level 2, size=50)
  ├── PARENT_OF → Country A2 "Japanese Cuisine" (level 1, size=200)
  ├── PARENT_OF → Country A3 "Southeast Asian Cuisine" (level 1, size=150)
  └── PARENT_OF → Country A4 "Korean Cuisine" (level 1, size=100)

What about Continent E "Antarctic Research Station Cafeteria" (3 entities)?

Continent E "Antarctic Research Station Cafeteria" (level 0, size=3)
  ├── Canned food
  ├── Hardtack
  └── Instant coffee

  (That's it — no outgoing PARENT_OF edges)

The relationships among these 3 entities:

• Canned food ↔ Hardtack (both are long-shelf-life foods)
• Canned food ↔ Instant coffee (both are ready-to-eat items)
• Hardtack ↔ Instant coffee (both are research station staples)

They're closely related, so they're grouped together. But with only 3 members — you can't split 3 people into "departments" and "teams." That would be absurd.

Meanwhile, Continent E's external connections are extremely sparse — only "canned food" has one weak link to Continent B's "canned olive oil." This connection is too weak for the algorithm to merge Continent E into Continent B.

Result: Continent E becomes an orphan — it can neither be subdivided downward nor merged into another group.

Why Do Orphans Occur? Two Conditions Must Be Met Simultaneously

                    ┌─────────────────────────┐
                    │  Community too small     │
                    │  (2~9 entities)          │
                    │  Cannot subdivide further│
                    └───────────┬─────────────┘
                                │
                                ▼
                    ┌─────────────────────────┐
                    │  Becomes an orphan       │
                    │  Community               │
                    │  No PARENT_OF edges      │
                    └───────────┬─────────────┘
                                │
                    ┌───────────┴─────────────┐
                    │  Extremely weak external │
                    │  connections             │
                    │  (1~2 cross-group edges) │
                    │  Not worth merging into  │
                    │  another group           │
                    └─────────────────────────┘

The Leiden algorithm's criterion is modularity:

• Subdivide downward: Split 3 people into 2 groups? Each group would have 1-2 people — no statistical significance, modularity won't improve. Abandoned.
• Merge into others: Only 1 weak connection to the nearest large group; forcing a merge would reduce that group's cohesion. Abandoned.

The Data Speaks

Returning to real GraphRAG data, the statistics perfectly confirm this pattern:

Orphan communities (no PARENT_OF edges):

Normal communities (have PARENT_OF edges, participate in hierarchical subdivision):

The pattern is crystal clear: the larger the size, the more likely it participates in the hierarchy; the smaller the size, the more likely it becomes an orphan.

In one real knowledge graph, level 0 had 41 communities total — 23 participated normally in hierarchical subdivision, while 18 became orphans. All orphans had sizes between 2 and 9.

Impact on GraphRAG Queries

Global Search

Global Search traverses community reports at a certain level to answer questions. If it chooses to traverse level 1 reports:

• ✅ Normal communities' information appears in level 1 sub-community reports
• ❌ Orphan communities have no level 1 sub-communities; their information won't appear in any level 1+ reports

Analogy: If you only read "country-level" reports, the Antarctic research station cafeteria's information won't appear in any country's report — because it doesn't belong to any country.

Local Search

Local Search finds relevant entities directly through entity vector matching, independent of the hierarchical structure. So entities within orphan communities can still be retrieved by Local Search.

Practical Impact

Since orphan communities are very small (2-9 entities) and contain limited information, their impact on most queries is minimal. But if your query happens to involve this "edge knowledge," you should be aware of this blind spot.

Summary

The Leiden hierarchical clustering algorithm's behavior is just like the real world, where the Antarctic research station truly doesn't belong to any country's administrative division — it's too small and too isolated; forcing it into some country would be unreasonable. The algorithm makes the same judgment: communities too small cannot be further subdivided, and communities with connections too weak to the outside won't be forcibly merged.