A damping factor controls how a Personalized PageRank walk balances following graph edges against teleporting back to query seed nodes. Higher values let activation travel farther but increase noise; lower values keep retrieval closer to the query. section 12.3.4
In graph-based retrieval, the parameter shapes associative activation:
- Seed nodes receive the personalization mass, and probability spreads through the knowledge graph. section 12.3.2
- The standard PageRank default of 0.85 spreads widely, while the 0.5 value used for HippoRAG keeps retrieval more query-focused. section 12.3.4
- Increasing damping does not guarantee deeper useful retrieval: hubs can dominate rankings, and an extreme value such as 0.95 can prevent convergence. section 12.4.4
A hidden bridge between query entities
For a query naming Alzheimer and the Institute, PPR can activate the hidden path through Perusini and Cerletti. The damping factor determines how readily that activation reaches these intermediate nodes, while the ranking still reflects graph structure rather than keyword overlap. section 12.3.4 section 12.3.2
Listing 12.4 Associative Retrieval.
from typing import List, Tuple
class AssociativeRetriever:
"""Implements retrieval using Personalized PageRank."""
def __init__(self, graph: nx.DiGraph):
"""Initialize with a populated knowledge graph."""
self.graph = graph
def retrieve(
self, query_seeds: List[str], damping: float = 0.5
) -> List[Tuple[str, float]]:
"""Execute probability flow from seed entities."""
personalization = { #A
node: (1.0 if node in query_seeds else 0.0)
for node in self.graph.nodes()
}
ppr_scores = nx.pagerank( #B
self.graph,
alpha=damping,
personalization=personalization
)
return sorted( #C
ppr_scores.items(),
key=lambda x: x[1],
reverse=True
)[:5] #D
Inspect a concise NetworkX implementation that passes the damping factor as alpha, applies seed personalization, and returns the highest-scoring nodes. section 12.3.4

