Catalog
affaan-m/social-graph-ranker

affaan-m

social-graph-ranker

Weighted social-graph ranking for warm intro discovery, bridge scoring, and network gap analysis across X and LinkedIn. Use when the user wants the reusable graph-ranking engine itself, not the broader outreach or network-maintenance workflow layered on top of it.

global
0installs0uses~1.0k
v1.1Saved Apr 20, 2026

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:

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:

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:

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

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
  • 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
Files1
1 files · 1.0 KB

Select a file to preview

Overall Score

72/100

Grade

B

Good

Safety

88

Quality

68

Clarity

78

Completeness

65

Summary

A graph-ranking skill that scores warm introduction paths in professional networks (X, LinkedIn) using weighted bridge algorithms. It ranks mutuals and connections by their value in reaching target people, accounting for path distance, engagement, and network gaps.

Detected Capabilities

Graph traversal and shortest-path scoringWeighted bridge calculation with decay factorsSecond-order connection expansion and rankingEngagement-adjusted scoring for relationship strengthTarget set weighting by role, industry, geography, influenceGap analysis and outreach recommendation logic

Trigger Keywords

Phrases that MCP clients use to match this skill to user intent.

warm intro discoverybridge scoringnetwork gap analysismutual rankinggraph traversal

Use Cases

  • Identify which connections can introduce you to target contacts
  • Rank warm introduction paths by bridge value and directness
  • Analyze network gaps and decide between warm intros vs. cold outreach
  • Score second-order connections for network expansion
  • Evaluate mutual value across first- and second-degree paths

Quality Notes

  • POSITIVE: Clear mathematical model with well-defined formulas (B(m), B_ext(m), R(m)) makes the ranking logic reproducible and auditable.
  • POSITIVE: Strong scope boundaries — explicitly states when NOT to use this skill and references related skills (`lead-intelligence`, `connections-optimizer`) to prevent misuse.
  • POSITIVE: Comprehensive workflow with six clear steps from input to output, reducing ambiguity for agent execution.
  • POSITIVE: Output shape template is well-structured and includes all necessary fields (scores, paths, recommendations) so agent knows what 'done' looks like.
  • POSITIVE: Weighting signals section is thorough, covering both target prioritization and mutual evaluation criteria.
  • NEUTRAL: Skill is conceptual/analytical rather than executable — it describes a model and workflow but does not include code, API calls, or concrete file operations. This is appropriate for a ranking framework, but agents implementing this will need external graph data sources.
  • NEGATIVE: No error handling guidance — does not address what to do if graph data is incomplete, targets are unreachable, or decay/engagement values are missing/invalid.
  • NEGATIVE: No concrete examples of inputs or outputs beyond the template — including a sample run with synthetic data would aid agent understanding and validation.
  • NEGATIVE: Decay factor (λ=0.5) and engagement bonus (β=0.2) are stated as 'usually' but not explained when to adjust them or how sensitive the ranking is to these parameters.
  • NEGATIVE: No discussion of how to handle ties in ranking or what to do if multiple mutuals have identical R(m) scores.
  • NEGATIVE: Engagement metric is mentioned but not defined operationally — does the agent fetch this from platform APIs, infer from historical interaction counts, or accept it as user input?
Model: claude-haiku-4-5-20251001Analyzed: Apr 20, 2026

Reviews

Add this skill to your library to leave a review.

No reviews yet

Be the first to share your experience.

Version History

v1.1

Content updated

2026-04-20

Latest
v1.0

No changelog

2026-04-12

Add affaan-m/social-graph-ranker to your library

Command Palette

Search for a command to run...