network-social-graph

Builds directed interaction graphs from reply chains to analyze reciprocity, interlocutors, and voice shifts.

13|2|Updated Feb 10, 2026
One-click install
npx skills add https://github.com/aaddrick/written-voice-replication --skill network-social-graph-aaddrick
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: network-social-graph
Source: https://github.com/aaddrick/written-voice-replication/tree/main/.claude/skills/network-social-graph
Command: npx skills add https://github.com/aaddrick/written-voice-replication --skill network-social-graph-aaddrick

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires networkx, pandas, numpy.

What problem does it solve? Conversation data with reply chains hides social structure that is hard to see manually: who talks to whom, whether interactions are mutual, and whether a user changes their writing style depending on the audience. This Skill turns raw reply chains into a measurable directed graph so those patterns can be quantified. ## Core Features & Use Cases - Directed Graph Construction: Extracts reply pairs from conversation data and builds a weighted NetworkX DiGraph with filtering for trivial interactions. - Ego Network & Reciprocity Analysis: Extracts a target user's ego network, classifies top interlocutors (balanced, ego-dominant, one-directional), and measures reciprocity at global, ego, and per-alter levels. - Audience-Dependent Voice Shift Detection: Compares linguistic features (word length, formality, vocabulary richness) across interlocutors to detect accommodation patterns, plus community detection for larger graphs. - Use Case: Given a Reddit comment export, map a user's interaction network, identify their five most frequent conversation partners, and determine whether their tone shifts when replying to different people. ## Quick Start Use the network-social-graph skill to analyze the reply chains in my conversation export and write the findings report.

Frequently Asked Questions about network-social-graph

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I build a social network graph from reply chains?

Extract directed edges as (replier, parent_author) pairs from your conversation data, then aggregate them into a weighted NetworkX DiGraph where edge weight equals interaction count. Filter out self-replies and trivially short messages before computing metrics.

How to measure reciprocity in an interaction network with NetworkX?

Use nx.reciprocity(G) on a directed graph for global reciprocity, then compute ego-level reciprocity as the fraction of a user's alters with mutual edges. Weighted reciprocity compares total outgoing versus incoming interaction volumes.

What is the minimum data needed for social network analysis?

Graph metrics require at least 10 interactions and 3 unique participants. Community detection needs 15+ nodes, voice shift detection needs 3+ alters with 5+ interactions each, and below 10 interactions only raw reply pairs should be reported.

Can interaction frequency indicate relationship strength?

No. Interaction frequency measures engagement volume, not affection, trust, or relationship quality. Fifty hostile exchanges produce the same edge weight as fifty friendly ones, so sentiment analysis from a separate method is needed for valence claims.

Why does community detection fail on small graphs?

Modularity optimization is statistically meaningless below roughly 15 nodes because there are too few possible partitions to distinguish real structure from chance. On small graphs, report that the network is too small and skip community detection entirely.