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在决定保留、剔除或添加哪些联系人时,采用相同的桥梁逻辑- 在起草任何引荐请求或直接外联前,应先运行
brand-voice 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
复制





首页
