hr-network-analyst
Compare original and translation side by side
🇺🇸
Original
English🇨🇳
Translation
ChineseHR Network Analyst
HR 网络分析师
Applies graph theory and network science to professional relationship mapping. Identifies hidden superconnectors, influence brokers, and knowledge mavens that drive professional ecosystems.
将图论和网络科学应用于职业关系图谱绘制，识别驱动职业生态系统的隐藏superconnectors、influence brokers和knowledge mavens。
Integrations
集成工具
Works with: career-biographer, competitive-cartographer, research-analyst, cv-creator
可与以下工具协同：career-biographer、competitive-cartographer、research-analyst、cv-creator
Core Questions Answered
核心可解答问题
- Who should I know? (optimal networking targets)
- Who knows everyone? (superconnectors for referrals)
- Who bridges worlds? (cross-domain brokers)
- How does influence flow? (information/opportunity pathways)
- Where are structural holes? (untapped connection opportunities)
- 我应该认识谁？（最优人脉拓展目标）
- 谁认识所有人？（可提供推荐的superconnectors）
- 谁在连接不同领域？（跨领域经纪人）
- 影响力如何流动？（信息/机会传递路径）
- 结构洞在哪里？（未被挖掘的连接机会）
Quick Start
快速开始
User: "Who are the key connectors in AI safety research?"
Process:
1. Define boundary: AI safety researchers, 2020-2024
2. Identify sources: arXiv, NeurIPS workshops, Twitter clusters
3. Compute centrality: betweenness (bridges), eigenvector (influence)
4. Classify by archetype: Connector, Maven, Broker
5. Output: Ranked list with network position rationaleKey principle: Most valuable people aren't always most famous—they connect otherwise disconnected worlds.
User: "Who are the key connectors in AI safety research?"
Process:
1. Define boundary: AI safety researchers, 2020-2024
2. Identify sources: arXiv, NeurIPS workshops, Twitter clusters
3. Compute centrality: betweenness (bridges), eigenvector (influence)
4. Classify by archetype: Connector, Maven, Broker
5. Output: Ranked list with network position rationale核心原则: 最具价值的人并不总是最知名的——他们连接着原本互不关联的群体。
Gladwellian Archetypes (Quick Reference)
Gladwellian Archetypes (速查)
| Type | Network Signature | HR Value |
|---|---|---|
| Connector | High betweenness + degree, bridges clusters | Best for cross-domain referrals |
| Maven | High in-degree, authoritative, creates content | Know who's good at what |
| Salesman | High influence propagation, deal networks | Close candidates, navigate negotiation |
Full theory: See
references/network-theory.md| 类型 | 网络特征 | HR价值 |
|---|---|---|
| Connector | 高betweenness + 高连接度，连接不同集群 | 最适合跨领域推荐 |
| Maven | 高入度，权威性，产出内容 | 了解谁擅长什么 |
| Salesman | 高影响力传播，交易网络 | 敲定候选人，应对谈判 |
完整理论: 参见
references/network-theory.mdCentrality Metrics (Quick Reference)
Centrality Metrics (速查)
| Metric | Meaning | When to Use |
|---|---|---|
| Betweenness | Controls information flow | Finding gatekeepers, brokers |
| Degree | Raw connection count | Maximizing referral reach |
| Eigenvector | Quality over quantity | Access to power, rising stars |
| PageRank | Endorsed by important others | Thought leaders |
| Closeness | Can reach anyone quickly | Information spreading |
| 指标 | 含义 | 使用场景 |
|---|---|---|
| Betweenness | 控制信息流 | 寻找守门人、经纪人 |
| Degree | 原始连接数量 | 最大化推荐覆盖范围 |
| Eigenvector | 质量优先于数量 | 接触权力阶层、潜力新星 |
| PageRank | 获重要人士认可 | 思想领袖 |
| Closeness | 可快速触达任何人 | 信息传播 |
Analysis Workflows
分析工作流
1. Find Superconnectors for Referrals
1. 寻找可提供推荐的Superconnectors
- Define target domain → Seed network → Expand → Compute betweenness + degree → Rank
- 定义目标领域 → 初始化网络 → 拓展网络 → 计算betweenness + degree → 排名
2. Map Domain Influence
2. 绘制领域影响力图谱
- Define boundaries → Multi-source construction → Community detection → Identify brokers
- 定义边界 → 多源网络构建 → 社区检测 → 识别经纪人
3. Optimize Personal Networking
3. 优化个人人脉网络
- Map current network → Map target domain → Find shortest paths → Identify structural holes
- 绘制当前网络图谱 → 绘制目标领域图谱 → 寻找最短路径 → 识别结构洞
4. Organizational Network Analysis (ONA)
4. 组织网络分析（ONA）
- Collect data (surveys, Slack metadata) → Construct graph → Find informal vs formal structure
Detailed workflows: See
references/data-sources-implementation.md- 收集数据（调研、Slack元数据） → 构建图谱 → 对比非正式与正式结构
详细工作流: 参见
references/data-sources-implementation.mdData Sources
数据源
| Source | Signal Strength | What to Extract |
|---|---|---|
| Co-authorship | Very strong | Publication collaborations |
| Conference co-panel | Strong | Speaking relationships |
| GitHub co-repo | Medium-strong | Code collaboration |
| LinkedIn connection | Medium | Professional links |
| Twitter mutual | Weak | Social association |
Multi-source fusion: Weight and combine signals for robust network
| 数据源 | 信号强度 | 提取内容 |
|---|---|---|
| 合著关系 | 极强 | 出版物合作关系 |
| 会议同场发言 | 强 | 演讲合作关系 |
| GitHub 共同仓库 | 中强 | 代码合作关系 |
| LinkedIn 连接 | 中 | 职业关联 |
| Twitter 互关 | 弱 | 社交关联 |
多源融合: 对不同信号赋予权重并整合，构建稳健的网络
When NOT to Use
禁止使用场景
- Surveillance: Tracking individuals without consent
- Discrimination: Using network position to exclude
- Manipulation: Engineering social influence for harm
- Privacy violation: Accessing non-public data
- Speculation without data: Guessing network structure
- 监视: 未经同意跟踪个人
- 歧视: 利用网络位置排除他人
- 操纵: 为有害目的设计社会影响力
- 侵犯隐私: 访问非公开数据
- 无数据猜测: 臆断网络结构
Anti-Patterns
反模式
Anti-Pattern: Degree Obsession
反模式：过度关注Degree
What it looks like: Only looking at who has most connections
Why wrong: High degree often = noise; connectors differ from popular
Instead: Use betweenness for bridging, eigenvector for influence quality
表现: 仅关注谁的连接数量最多
问题: 高Degree往往意味着噪声；连接者与受欢迎的人并非同一类
正确做法: 使用betweenness识别桥梁角色，用eigenvector衡量影响力质量
Anti-Pattern: Static Network Assumption
反模式：静态网络假设
What it looks like: Treating 5-year-old connections as current
Why wrong: Networks evolve; old edges may be dead
Instead: Recency-weight edges, verify currency
表现: 将5年前的连接视为当前有效连接
问题: 网络会演化；旧的关联可能已失效
正确做法: 按时间远近为连接赋予权重，验证有效性
Anti-Pattern: Single-Source Reliance
反模式：单一数据源依赖
What it looks like: Using only LinkedIn data
Why wrong: Missing relationships not on LinkedIn
Instead: Multi-source fusion with source-appropriate weighting
表现: 仅使用LinkedIn数据
问题: 遗漏未在LinkedIn上体现的关系
正确做法: 多源融合，并根据数据源特性赋予相应权重
Anti-Pattern: Ignoring Context
反模式：忽略上下文
What it looks like: High betweenness = valuable, regardless of domain
Why wrong: Bridging irrelevant communities isn't useful
Instead: Constrain analysis to relevant domain boundaries
表现: 认为高betweenness就有价值，无论所属领域
问题: 连接无关社区并无实际用处
正确做法: 将分析限定在相关领域边界内
Ethical Guidelines
伦理准则
Acceptable:
- Analyzing public data (conference speakers, publications)
- Aggregate pattern analysis
- Opt-in organizational analysis
- Academic research with proper IRB
NOT Acceptable:
- Scraping private profiles without consent
- Building surveillance systems
- Selling individual data
- Discrimination based on network position
可接受场景:
- 分析公开数据（会议演讲者、出版物）
- 聚合模式分析
- 自愿参与的组织分析
- 经IRB批准的学术研究
不可接受场景:
- 未经同意抓取私人资料
- 构建监视系统
- 售卖个人数据
- 基于网络位置的歧视
Troubleshooting
故障排查
| Issue | Cause | Fix |
|---|---|---|
| Can't find data | Domain small/private | Snowball sampling, surveys, adjacent communities |
| False edges | Over-weighting weak signals | Require multiple signals, threshold weights |
| Too large | Unconstrained boundary | K-core filtering, high-weight only |
| Entity resolution | Same person, different names | Unique IDs (ORCID), manual verification |
| 问题 | 原因 | 解决方法 |
|---|---|---|
| 无法找到数据 | 领域小众/私密 | 滚雪球抽样、调研、拓展至相邻社区 |
| 错误关联 | 过度加权弱信号 | 要求多信号验证，设置权重阈值 |
| 数据量过大 | 未限定边界 | K核过滤，仅保留高权重连接 |
| 实体解析问题 | 同一人使用不同名称 | 使用唯一ID（如ORCID），人工验证 |
Reference Files
参考文件
- - NetworkX code patterns, centrality formulas, Gladwell classification
references/algorithms.md - - Neo4j, Neptune, TigerGraph, ArangoDB query examples
references/graph-databases.md - - LinkedIn network data acquisition strategies, APIs, scraping, legal considerations
references/data-sources.md
Core insight: Advantage comes from bridging otherwise disconnected groups, not from connections within dense clusters. — Ron Burt, Structural Holes Theory
- - NetworkX代码示例、centrality计算公式、Gladwell分类方法
references/algorithms.md - - Neo4j、Neptune、TigerGraph、ArangoDB查询示例
references/graph-databases.md - - LinkedIn网络数据获取策略、API、抓取、法律考量
references/data-sources.md
核心洞见: 优势来自于连接原本互不关联的群体，而非在密集集群内建立连接。 — Ron Burt，Structural Holes Theory