social-graph-ranker
affaan-m/ECC
針對「溫和引薦」,透過採用包含衰減與互動加成的加權圖模型,依據橋接值對共同聯繫人進行排序。
...展開全部社交圖譜排名器
用於網路感知外展活動的標準加權圖排序層。
當使用者需要以下功能時,請使用此功能:
- 根據引薦價值對現有的互相關聯者或聯繫人進行排序
- 將「溫暖路徑」映射至目標清單
- 衡量一級與二級聯繫人之間的橋接價值
- 決定哪些目標應採用「溫暖介紹」,哪些應採用「直接冷聯繫」
- 在不依賴
潛在客戶情報或人脈優化器的情況下,獨立理解圖論數學
何時使用此獨立模組
當使用者主要需要排名引擎時,請選擇此技能:
- 「在我的人脈中,誰最適合為我引薦?」
- 「根據誰能幫我接觸這些人,來對我的共同聯絡人進行排序」
- 「將我的社交圖譜與此 ICP 進行對照」
- 「向我展示橋接邏輯」
若使用者真正需要的是:
- 完整的潛在客戶開發與外展流程 → 請使用「
潛在客戶智慧」 - 修剪、重新平衡及擴展人脈網絡 → 請使用「
人脈優化器」
輸入
收集或推斷:
- 目標對象、企業或理想客戶画像(ICP)定義
- 使用者在 X、LinkedIn 或兩者上的當前人脈圖
- 權重優先級,例如職位、產業、地理位置及回應速度
- 遍歷深度與衰減容差
核心模型
已知:
T= 加權目標集合M= 您當前的共同聯繫人/直接聯繫人d(m, t)= 從共同聯繫人m到目標t的最短跳數w(t)= 根據訊號評分計算出的目標權重
基礎橋接分數:
B(m) = Σ_{t ∈ T} w(t) · λ^(d(m,t) - 1)
其中:
λ為衰減因子,通常為0.5- 直接路徑貢獻全額權重
- 每增加一個跳點,貢獻值減半
二階展開:
B_ext(m) = B(m) + α · Σ_{m' ∈ N(m) \\ M} Σ_{t ∈ T} w(t) · λ^(d(m',t))
其中:
N(m) \\ M是指你與該共同好友皆認識、但你未曾認識的人的集合α用於折算二階觸及率,通常為0.3
經回應調整後的最終排名:
R(m) = B_ext(m) · (1 + β · engagement(m))
其中:
engagement(m)為歸一化的回應度或關係強度β為互動加成,通常為0.2
解釋:
- 第 1 級:高
R(m)且具直接橋接路徑 → 溫暖型引薦請求 - 第二級:中等
R(m)且具單跳橋接路徑 → 有條件的引薦請求 - 第三級:
R(m)值低或無可行橋接路徑 → 直接聯繫或填補跟進缺口
評分指標
在進行圖遍歷前,依據當前優先級集的相關因素設定權重目標:
- 職務或頭銜的契合度
- 公司或產業契合度
- 當前活動與近期動態
- 地理相關性
- 影響力或觸及範圍
- 回應的可能性
在遍歷後,根據以下條件對相互關聯進行加權:
- 通往目標集合的加權路徑數量
- 這些路徑的直接性
- 回應意願或過往互動紀錄
- 進行介紹時的語境契合度
工作流程
- 建立加權目標集。
- 從 X、LinkedIn 或兩者同時擷取使用者的社交圖譜。
- 計算直接橋接分數。
- 針對價值最高的共同聯絡人,擴展二階候選名單。
- 依
R(m)進行排序。 - 回傳:
- 最佳的「暖場介紹」邀請
- 條件性橋接路徑
- 不存在「暖引薦路徑」的圖形缺口
輸出結構
社交圖譜排名
====================
優先級集:
平台:
衰減模型:
頂級橋接路徑
- 互相關聯 / 連結
基礎分數:
擴展分數:
最佳目標:
路徑摘要:
建議行動:
條件路徑
- 互相關聯 / 連結
原因:
額外跳數成本:
無熱路徑
- 目標
建議:直接接觸 / 填補圖形缺口
相關技能
lead-intelligence在更廣泛的目標發掘與外展流程中使用此排名模型connections-optimizer在決定保留、刪除或新增哪些聯繫人時,會採用相同的橋接邏輯- 在起草任何介紹請求或直接聯繫之前,應先執行
「品牌語調」模組 x-api提供 X 圖譜存取權限及可選的執行路徑
---
name: social-graph-ranker
description: Ranks mutual connections by bridge value for warm introductions, using a weighted graph model with decay and engagement bonuses.
---
# Social Graph Ranker
Canonical weighted graph-ranking layer for network-aware outreach.
Use this when the user needs to:
- rank existing mutuals or connections by intro value
- map warm paths to a target list
- measure bridge value across first- and second-order connections
- decide which targets deserve warm intros versus direct cold outreach
- understand the graph math independently from `lead-intelligence` or `connections-optimizer`
## When To Use This Standalone
Choose this skill when the user primarily wants the ranking engine:
- "who in my network is best positioned to introduce me?"
- "rank my mutuals by who can get me to these people"
- "map my graph against this ICP"
- "show me the bridge math"
Do not use this by itself when the user really wants:
- full lead generation and outbound sequencing -> use `lead-intelligence`
- pruning, rebalancing, and growing the network -> use `connections-optimizer`
## Inputs
Collect or infer:
- target people, companies, or ICP definition
- the user's current graph on X, LinkedIn, or both
- weighting priorities such as role, industry, geography, and responsiveness
- traversal depth and decay tolerance
## Core Model
Given:
- `T` = weighted target set
- `M` = your current mutuals / direct connections
- `d(m, t)` = shortest hop distance from mutual `m` to target `t`
- `w(t)` = target weight from signal scoring
Base bridge score:
```text
B(m) = Σ_{t ∈ T} w(t) · λ^(d(m,t) - 1)
```
Where:
- `λ` is the decay factor, usually `0.5`
- a direct path contributes full value
- each extra hop halves the contribution
Second-order expansion:
```text
B_ext(m) = B(m) + α · Σ_{m' ∈ N(m) \\ M} Σ_{t ∈ T} w(t) · λ^(d(m',t))
```
Where:
- `N(m) \\ M` is the set of people the mutual knows that you do not
- `α` discounts second-order reach, usually `0.3`
Response-adjusted final ranking:
```text
R(m) = B_ext(m) · (1 + β · engagement(m))
```
Where:
- `engagement(m)` is normalized responsiveness or relationship strength
- `β` is the engagement bonus, usually `0.2`
Interpretation:
- Tier 1: high `R(m)` and direct bridge paths -> warm intro asks
- Tier 2: medium `R(m)` and one-hop bridge paths -> conditional intro asks
- Tier 3: low `R(m)` or no viable bridge -> direct outreach or follow-gap fill
## Scoring Signals
Weight targets before graph traversal with whatever matters for the current priority set:
- role or title alignment
- company or industry fit
- current activity and recency
- geographic relevance
- influence or reach
- likelihood of response
Weight mutuals after traversal with:
- number of weighted paths into the target set
- directness of those paths
- responsiveness or prior interaction history
- contextual fit for making the intro
## Workflow
1. Build the weighted target set.
2. Pull the user's graph from X, LinkedIn, or both.
3. Compute direct bridge scores.
4. Expand second-order candidates for the highest-value mutuals.
5. Rank by `R(m)`.
6. Return:
- best warm intro asks
- conditional bridge paths
- graph gaps where no warm path exists
## Output Shape
```text
SOCIAL GRAPH RANKING
====================
Priority Set:
Platforms:
Decay Model:
Top Bridges
- mutual / connection
base_score:
extended_score:
best_targets:
path_summary:
recommended_action:
Conditional Paths
- mutual / connection
reason:
extra hop cost:
No Warm Path
- target
recommendation: direct outreach / fill graph gap
```
## Related Skills
- `lead-intelligence` uses this ranking model inside the broader target-discovery and outreach pipeline
- `connections-optimizer` uses the same bridge logic when deciding who to keep, prune, or add
- `brand-voice` should run before drafting any intro request or direct outreach
- `x-api` provides X graph access and optional execution paths
所有檔案
1 個檔案安裝 social-graph-ranker
請下載並將技能檔案解壓縮至您的 .claude/skills/ 目錄中。
下載 ZIP複製儲存庫並將技能檔案複製到您的專案中。
git clone https://github.com/affaan-m/ECC/tree/main/skills/social-graph-ranker # Copy SKILL.md to your .claude/skills/ directory
複製





首頁
